46 search results - page 4 / 10 » Strong normalization proofs by CPS-translations |
114
click to vote
IFIP
2004
Springer
15 years 2 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
TLCA
2007
Springer
15 years 3 months ago
2007
Springer
e type system for the lmdElulus enrihed with reurE sive nd oreursive funtions over equiEindutive nd Eoindutive types is presented in whih ll wel...
LPNMR
2007
Springer
15 years 3 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
LICS
1990
IEEE
15 years 1 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
TLCA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natu...