From Natural Semantics to Abstract Machines

From Natural Semantics to Abstract Machines (2004)

by Mads Sig Ager

Citations:

4 - 0 self

@MISC{Ager04fromnatural,
    author = {Mads Sig Ager},
    title = {From Natural Semantics to Abstract Machines},
    year = {2004}
}

280	Natural semantics - Kahn - 1988
53	From operational semantics to abstract machines - Hannan, Miller - 1992
52	A functional correspondence between evaluators and abstract machines - Ager, Biernacki, et al. - 2003
38	The Calculi of λ-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages - Felleisen - 1987
34	A functional correspondence between monadic evaluators and abstract machines for languages with computational effects - Ager, Danvy, et al. - 2005
32	A functional correspondence between callby-need evaluators and lazy abstract machines - Ager, Danvy, et al. - 2004
24	Programming languages and lambda calculi, unpublished lecture notes available at and last accessed in - Felleisen, Flatt - 2008
23	A rational deconstruction of Landin’s SECD machine - Danvy - 2003
22	Functional runtime systems within the lambda-sigma calculus - Hardin, Maranget, et al. - 1998
19	O.: From interpreter to logic engine by defunctionalization - Biernacki, Danvy - 2003
16	Abstract machines for programming language implementation - Diehl, Sestoft - 2000
6	An abstract machine for the normalization of λ-terms - Crégut - 1990
4	Adapting big-step semantics to small-step style: Coinductive interpretations and “higher-order” derivations - Ibraheem, Schmidt - 2000