Normal Forms and Cut-Free Proofs as Natural Transformations (1992)

by Jean-Yves Girard , Andre Scedrov , Philip J. Scott
Venue:in : Logic From Computer Science, Mathematical Science Research Institute Publications 21
Citations:12 - 4 self

Documents Related by Co-Citation

430 Introduction to higher order categorical logic Cambridge – J Lambek, P J Scott - 1986
928 S.: Categories for the Working Mathematician – Mac Lane - 1998
944 A theory of type polymorphism in programming – Robin Milner - 1978
571 1934-1935), “Untersuchungen Uber das logische Schliessen – Gerhard Gentzen
1121 The Lambda Calculus, its Syntax and Semantics – H P Barendregt - 1981
604 A Mathematical Introduction to Logic – H Enderton - 1972
441 The formulas-as-types notion of construction – W A Howard - 1980
445 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
429 Teleporting an Unknown Quantum State via Dual Classical and EPR Channels – Charles H. Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres, William K. Wootters - 1993