46 search results - page 1 / 10 » Strong normalization proofs by CPS-translations |
APLAS
2007
ACM
13 years 8 months ago
2007
ACM
Abstract. This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski...
IPL
2006
13 years 4 months ago
2006
In this paper, we propose a new proof method for strong normalization of calculi with control operators, and, by this method, we prove strong normalization of the system
RTA
2007
Springer
13 years 10 months ago
2007
Springer
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
RTA
1999
Springer
13 years 9 months ago
1999
Springer
