The spineless tagless G-machine, naturally

No abstract is available for this paper.

• Publication year

  1998

• Venue

  ACM SIGPLAN International Conference on Functional Programming

• Publication date

  1998-09-29

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/289423.289439
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Functional Programming

  2020cited by this paper
• Implementing Functional Languages: a tutorial

  2000cited by this paper
• The call-by-need lambda calculus

  1998cited by this paper
• Formally based profiling for higher-order functional languages

  1997cited by this paper
• Deriving a lazy abstract machine

  1997influential reference
• A Taxonomy of Functional Language Implementations Part II : Call-by-Name, Call-by-Need and Graph Reduction

  1996cited by this paper
• Compiling Haskell by Program Transformation: A Report from the Trenches

  1996cited by this paper
• An Operational Semantics of Sharing in Lazy Evaluation

  1996cited by this paper
• Semantics-directed generation of compilers and abstract machines

  1996cited by this paper
• Imperative functional programming

  1996cited by this paper
• Once upon a type

  1995cited by this paper
• Execution profiling for non-strict functional languages

  1994cited by this paper
• On the equivalence between CMC and TIM

  1994cited by this paper
• Heap profiling of lazy functional programs

  1993cited by this paper
• A natural semantics for lazy evaluation

  1993influential reference
• An operational semantics of lazy evaluation for analysis

  1993cited by this paper
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine

  1992influential reference
• No assembly required

  1992cited by this paper
• Tail recursion without space leaks

  1992influential reference
• Making Abstract Machines Less Abstract

  1991cited by this paper
• Compiling with Continuations

  1991cited by this paper
• The HDG-Machine: A Highly Distributed Graph-Reducer for a Transputer Network

  1991cited by this paper
• For a Better Support of Static Data Flow

  1991cited by this paper
• A syntactic approach to program transformations

  1991cited by this paper
• Compilation of functional languages by program transformation

  1991cited by this paper
• A modular fully‐lazy lambda lifter in Haskell

  1991cited by this paper
• Generating Efficient Code for Lazy Functional Languages

  1991cited by this paper
• Representing control in the presence of first-class continuations

  1990cited by this paper
• Debugging standard ML without reverse engineering

  1990cited by this paper
• Adding threads to Standard ML

  1990cited by this paper
• Functional programs as executable specifications

  1990cited by this paper
• Continuation-passing, closure-passing style

  1989cited by this paper
• Simple generational garbage collection and fast allocation

  1989cited by this paper
• Parallel graph reduction with the (v , G)-machine

  1989cited by this paper
• CASE-a lazy version of an SECD machine with a flat environment

  1989cited by this paper
• Why Functional Programming Matters

  1989cited by this paper
• High-Performance parallel graph reduction

  1989cited by this paper
• Compilation by program transformation

  1989cited by this paper
• FLIC—a functional language intermediate code

  1988cited by this paper
• Code optimizations for lazy evaluation

  1988cited by this paper
• TIM: A simple, lazy abstract machine to execute supercombinatorics

  1987influential reference
• Categorical multi-combinators

  1987influential reference
• The Implementation of Functional Programming Languages

  1987cited by this paper
• The Implementation of Functional Programming Languages (Prentice-hall International Series in Computer Science)

  1987cited by this paper
• A RISC architecture for symbolic computation

  1987cited by this paper
• Garbage Collection can be Faster than Stack Allocation

  1987influential reference
• Lambda Lifting: Treansforming Programs to Recursive Equations

  1985influential reference
• Functional Programming Languages and Computer Architecture

  1985cited by this paper
• Some practical methods for rapid combinator reduction

  1984cited by this paper
• Efficient compilation of lazy evaluation

  1984influential reference
• Functional programming - application and implementation

  1980cited by this paper
• A new implementation technique for applicative languages

  1979cited by this paper
• List Processing in Real Time on a Serial Computer

  1978cited by this paper
• Rabbit: A Compiler for Scheme

  1978cited by this paper

• Biorthogonality for a Lazy language

  2017cites this paper
• Amortised Resource Analysis for Lazy Functional Programs

  2014cites this paper
• Automatic amortised analysis of dynamic memory allocation for lazy functional programs

  2012cites this paper
• A systematic derivation of the STG machine verified in Coq

  2010cites this paper
• Explaining the lazy Krivine machine using explicit substitution and addresses

  2007cites this paper
• The Lazy Virtual Machine speciflcation

  2004cites this paper
• Formally deriving an STG machine

  2003cites this paper
• Proving the Correctness of the STG Machine

  2001influential citation
• Modularni interpreteri u Haskell-u Verzija 1.0

  2000cites this paper
• A model for comparing the space usage of lazy evaluators

  2000cites this paper
• Under Consideration for Publication in J. Functional Programming from Natural Semantics to C: a Formal Derivation of Two Stg Machines

  year unknowncites this paper