منابع مشابه
The stack calculus
We introduce a functional calculus with simple syntax and operational semantics in which the calculi introduced so far in the Curry–Howard correspondence for Classical Logic can be faithfully encoded. Our calculus enjoys confluence without any restriction. Its type system enforces strong normalization of expressions and it is a sound and complete system for full implicational Classical Logic. W...
متن کاملThe untyped stack calculus and Bohm's theorem
The stack calculus is a functional language in which is in a Curry-Howard correspondence with classical logic. It enjoys confluence but, as well as Parigot's λ µ, does not admit the Böhm Theorem, typical of the λ-calculus. We present a simple extension of stack calculus which is for the stack calculus what Saurin's Λµ is for λ µ.
متن کاملImplementation of the Typed Call - by - Value - calculus using a Stack
We present a translation scheme for the polymorphi-cally typed call-by-value-calculus. All runtime values , including function closures, are put into regions. The store consists of a stack of regions. Region inference and eeect inference are used to infer where regions can be allocated and de-allocated. Recursive functions are handled using a limited form of polymor-phic recursion. The translat...
متن کاملImplementation of the Typed Call - by - Value - calculus using a Stack ofRegionsMads
We present a translation scheme for the polymorphi-cally typed call-by-value-calculus. All runtime values , including function closures, are put into regions. The store consists of a stack of regions. Region inference and eeect inference are used to infer where regions can be allocated and de-allocated. Recursive functions are handled using a limited form of polymor-phic recursion. The translat...
متن کاملImplementation of the Typed Call-by-Value λ-calculus using a Stack of Regions
We present a translation scheme for the polymorphically typed call-by-value λ-calculus. All runtime values, including function closures, are put into regions. The store consists of a stack of regions. Region inference and effect inference are used to infer where regions can be allocated and de-allocated. Recursive functions are handled using a limited form of polymorphic recursion. The translat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.113.10