Programs as Data Objects - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540164463, 9783540397861

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Program transformation by supercompilation

Programs as Data Objects - Lecture Notes in Computer Science ◽

10.1007/3-540-16446-4_15 ◽

1986 ◽

pp. 257-281 ◽

Cited By ~ 6

Author(s):

Valentin F. Turchin

Keyword(s):

Program Transformation

Download Full-text

Expected forms of data flow analyses

Programs as Data Objects - Lecture Notes in Computer Science ◽

10.1007/3-540-16446-4_10 ◽

1986 ◽

pp. 172-191 ◽

Cited By ~ 7

Author(s):

Flemming Nielson

Keyword(s):

Data Flow

Download Full-text

From interpreter to compiler: A representational derivation

Programs as Data Objects - Lecture Notes in Computer Science ◽

10.1007/3-540-16446-4_17 ◽

1986 ◽

pp. 306-324 ◽

Cited By ~ 3

Author(s):

Mitchell Wand

Download Full-text

Logic specification of code generation techniques

Programs as Data Objects - Lecture Notes in Computer Science ◽

10.1007/3-540-16446-4_6 ◽

1986 ◽

pp. 96-111 ◽

Cited By ~ 3

Author(s):

Robert Giegerich

Keyword(s):

Code Generation

Download Full-text

Modular first-order specifications of operational semantics

Programs as Data Objects - Lecture Notes in Computer Science ◽

10.1007/3-540-16446-4_5 ◽

1986 ◽

pp. 82-95 ◽

Cited By ~ 2

Author(s):

Harald Ganzinger

Keyword(s):

Operational Semantics ◽

First Order

Download Full-text

The theory of strictness analysis for higher order functions

Programs as Data Objects - Lecture Notes in Computer Science ◽

10.1007/3-540-16446-4_3 ◽

1986 ◽

pp. 42-62 ◽

Cited By ~ 22

Author(s):

GL Burn ◽

CL Hankin ◽

S Abramsky

Keyword(s):

Higher Order ◽

Strictness Analysis ◽

Higher Order Functions

Download Full-text

Listlessness is better than laziness II: Composing listless functions

Programs as Data Objects - Lecture Notes in Computer Science ◽

10.1007/3-540-16446-4_16 ◽

1986 ◽

pp. 282-305 ◽

Cited By ~ 7

Author(s):

Philip Wadler

Keyword(s):

Better Than

Download Full-text

Strictness analysis and polymorphic invariance

Programs as Data Objects - Lecture Notes in Computer Science ◽

10.1007/3-540-16446-4_1 ◽

1986 ◽

pp. 1-23 ◽

Cited By ~ 18

Author(s):

Samson Abramsky

Keyword(s):

Strictness Analysis

Download Full-text

An implementation from a direct semantics definition

Programs as Data Objects - Lecture Notes in Computer Science ◽

10.1007/3-540-16446-4_13 ◽

1986 ◽

pp. 222-235 ◽

Cited By ~ 2

Author(s):

David A. Schmidt

Download Full-text

Strictness detection in non-flat domains

Programs as Data Objects - Lecture Notes in Computer Science ◽

10.1007/3-540-16446-4_7 ◽

1986 ◽

pp. 112-135 ◽

Cited By ~ 7

Author(s):

John Hughes

Download Full-text

Programs as Data Objects - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Program transformation by supercompilation

Expected forms of data flow analyses

From interpreter to compiler: A representational derivation

Logic specification of code generation techniques

Modular first-order specifications of operational semantics

The theory of strictness analysis for higher order functions

Listlessness is better than laziness II: Composing listless functions

Strictness analysis and polymorphic invariance

An implementation from a direct semantics definition

Strictness detection in non-flat domains

Programs as Data Objects - Lecture Notes in Computer Science
Latest Publications