Showing papers presented at "International Symposium on Theoretical Aspects of Computer Software in 1994"
19 Apr 1994
94 citations
[...]
TL;DR: By restriction of Felleisen's control operator F, the authors obtained an operator Δ and a Church-Rosser control calculus λΔ enjoying a number of desirable properties, including a strongly normalizing typed subcalculus with a reduction corresponding closely to systems of proof normalization for classical logic.
Abstract: By restriction of Felleisen's control operator F we obtain an operator Δ and a fully compatible, Church-Rosser control calculus λΔ enjoying a number of desirable properties It is shown that λΔ contains a strongly normalizing typed subcalculus with a reduction corresponding closely to systems of proof normalization for classical logic The calculus is more than strong enough to express a call-by-name catch/throw-programming paradigm
43 citations
19 Apr 1994
TL;DR: In this article, a type assignment system with intersection and union types is introduced and the induced logical semantics is proved to be fully abstract, and the operational semantics is stated in terms of a must convergency predicate.
Abstract: Type free lazy λ-calculus is enriched with angelic parallelism and demonic nondeterminism. Call-by-name and call-by-value abstractions are considered and the operational semantics is stated in terms of a must convergency predicate. We introduce a type assignment system with intersection and union types and we prove the induced logical semantics to be fully abstract.
7 citations