3 search results - page 1 / 1 » Strong normalization of a symmetric lambda calculus for seco... |
AML
2002
13 years 4 months ago
2002
Abstract We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.
ICFP
2010
ACM
13 years 4 months ago
2010
ACM
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
LICS
2007
IEEE
13 years 10 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...