P. Cr'egut, "An Abstract Machine for the Normalization of Lambda-terms", LFP'90. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Functional Back-Ends within the Lambda-Sigma Calculus - Th'er Ese (1996) (3 citations) (Correct)
....of an archetypal target language. With respect to the formal description of their output, published compilers for functional languages fall into three classes: they either compile to combinator or supercombinator [5] terms, to terms in continuation passing style (CPS) 2] or to abstract machines [16, 7, 6, 8, 18]. These different approaches are praised for their peculiarities: combinators for their rewriting aspects and adequation to lazy evaluation [23] CPS for its ability to encode explicitly a given strategy and abstract machines for their closeness to real computers. None of these frameworks is ....
....M [id] M 0 M 1 . M f (S normal form) Phi Phi Phi Phi Phi Phi Phi H H HY H H Hj S S S : This diagram illustrates the ideal case when they are no silent transitions. 3 The Krivine Machine As a gentle introduction to our framework, we describe the Krivine Machine [8]. This machine is very simple: instruction : Grab Push(code) Access(n) frame : closure A typical state D is thus a stack of closures, which we write f n : f n Gamma1 : f 1 . A DB term is compiled as follows: n ] Access(n) N ] Grab; N ] N 1 N 2 ) Push( ....
[Article contains additional citation context not shown here]
P. Cr'egut, "An Abstract Machine for the Normalization of Lambda-terms", LFP'90.
Functional Back-Ends within the Lambda-Sigma Calculus - Hardin, Maranget, Pagano (1996) (8 citations) (Correct)
....an archetypal target language. With respect to the formal description of their output, published compilers for functional languages fall into three classes: they either compile to combinator or supercombinator [5] terms, to terms in continuation passing style (CPS) 2] or to abstract machines [16, 7, 6, 8, 18]. These di erent approaches are praised for their peculiarities: IBP LITP, Universit e Pierre et Marie Curie, 75252 Paris Cedex 05, France. y INRIA Rocquencourt, BP 105, 78153 Le Chesnay Cedex France. Email: fTherese.Hardin,Luc.Maranget,Bruno.Paganog inria.fr This work was partially ....
.... . Basically, the rule (Id) states that id is the identity substitution that maps variables to themselves. This point is important, since it is a rst illustration of using the strong calculus to assert a correctness property. 3 The Krivine Machine First, we describe the Krivine Machine [8]. This machine is very simple: instruction : Grab Push(code) Access(n) frame : closure A typical state D is thus a stack of closures, which we write f1 : f2 : fn . A DB term is compiled as follows: n ] Access(n) M ] Grab; M ] M N) Push( N ] ....
[Article contains additional citation context not shown here]
P. Cregut, \An Abstract Machine for the Normalization of Lambda-terms", LFP'90.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC