Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Sequent Calculi and Abstract Machines ZENA M. ARIOLA
 

Summary: Sequent Calculi and Abstract Machines
ZENA M. ARIOLA
University of Oregon
AARON BOHANNON
University of Pennsylvania
and
AMR SABRY
Indiana University
We propose a calculus derived from the #µ”µ­calculus of Curien and Herbelin that can represent
both closures and control. The calculus can directly encode and simulate various abstract ma­
chines, which we illustrate by providing encodings for the Krivine (call­by­name) and the CEK
(call­by­value) abstract machines.
Categories and Subject Descriptors: D.3.3 [Programming Techniques]: Language Constructs
and Features---Control structures, coroutines; F.3.3 [Logics and Meanings of Programs]:
Studies of Program Constructs---Control primitives; F.3.2 [Logics and Meanings of Pro­
grams]: Semantics of Programming Languages---Operational Semantics; F.4.1 [Mathematical
Logic and Formal Languages]: Mathematical Logic---Lambda calculus and related systems;
D.1.1 [Programming Techniques]: Applicative (Functional) Programming
General Terms: Languages,Theory
Additional Key Words and Phrases: Curry­Howard Isomorphism, Duality, Explicit Substitutions,

  

Source: Ariola, Zena M. - Department of Computer and Information Science, University of Oregon

 

Collections: Computer Technologies and Information Sciences