From Natural Semantics to Abstract Machines

2005 ◽  
pp. 245-261 ◽  
Author(s):  
Mads Sig Ager
Keyword(s):  
Abstract Machines

Distilling abstract machines

2014 ◽  
Vol 49 (9) ◽  
pp. 363-376 ◽  
Author(s):  
Beniamino Accattoli ◽  
Pablo Barenbaum ◽  
Damiano Mazza
Keyword(s):  
Abstract Machines

scholarly journals Fully abstract encodings of λ-calculus in HOcore through abstract machines

2017 ◽  
Author(s):  
Malgorzata Biernacka ◽  
Dariusz Biernacki ◽  
Serguei Lenglet ◽  
Piotr Polesiuk ◽  
Damien Pous ◽  
...  
Keyword(s):  
Abstract Machines

Implementing Dynamic Aggregations of Abstract Machines in the B Method

2004 ◽  
pp. 403-417 ◽  
Author(s):  
Nazareno Aguirre ◽  
Juan Bicarregui ◽  
Lucio Guzmán ◽  
Tom Maibaum
Keyword(s):  
B Method ◽  
Abstract Machines

scholarly journals On the equivalence between CMC and TIM

1994 ◽  
Vol 4 (1) ◽  
pp. 47-63 ◽  
Author(s):  
Rafael D. Lins ◽  
Simon J. Thompson ◽  
Simon Peyton Jones
Keyword(s):  
Programming Languages ◽  
Functional Programming ◽  
Design Space ◽  
Functional Programming Languages ◽  
Models Of Computation ◽  
Abstract Machines ◽  
Rewriting System

AbstractIn this paper we present an equivalence between TIM, a machine developed to implement non-strict functional programming languages, and the set of Categorical Multi-Combinators, a rewriting system developed with similar aims. These two models of computation at first appear to be quite different, but we show a direct equivalence between them, thereby adding some new structure to the ‘design-space’ of abstract machines for non-strict languages.

Sign in / Sign up

Export Citation Format

Share Document