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

26 Categorical data types in parametric polymorphism – R Hasegawa - 1994
134 The structure of multiplicatives – Vincent Danos, Laurent Regnier - 1989
6 Functorial parametricity – P J Freyd, E P Robinson, G Rosolini - 1992
427 Introduction to Higher Order Categorical Logic – J Lambek, P Scott - 1986
5 Dinaturality for Free, in – P J Freyd, E P Robinson, G Rosolini - 1992
5 Games and Full Completeness for Multiplicative Linear – S Abramsky, R Jagadeesan - 1994
3 Duality of Vector Spaces, Cahiers de Top. et Geom – M Barr - 1976
81 Quasitriangular Hopf algebras and Yang-Baxter equations – S Majid - 1990
86 Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic – V M Abrusci - 1991
47 Algebraic topology – S Lefschetz - 1942
120 Hopf algebras – E Abe - 2004
85 Quantales and (noncommutative) linear logic – David N Yetter
119 Respresentations of categories – M Barr - 1986
34 Domain Theoretic Models Of Polymorphism – Thierry Coquand, Carl A. Gunter, Glynn Winskel - 1989
141 The system F of variable types: Fifteen years later – J-Y Girard - 1986
58 Lambda-definability in the full type hierarchy – G Plotkin - 1980
45 Many-variable functorial calculus (I – G M Kelly - 1972
214 Closed categories – Samuel Eilenberg, G Max Kelly - 1965
47 Polymorphism is set-theoretic constructively – A Pitts - 1988