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
132 The structure of multiplicatives – V Danos, L Regnier - 1989
6 Functorial parametricity – P J Freyd, E P Robinson, G Rosolini - 1992
424 Introduction to Higher Order Categorical Logic – J Lambek, P J 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
85 Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic – V M Abrusci - 1991
47 Algebraic Topology – S Lefschetz - 1942
115 Autonomous Categories – M Barr - 1979
3 Duality of Vector Spaces, Cahiers de Top. et Geom – M Barr - 1976
83 Quantales and (noncommutative) linear logic – D N Yetter - 1990
80 Quasitriangular Hopf algebras and Yang-Baxter equations – S Majid - 1990
121 Hopf algebras – E Abe - 2004
34 Domain Theoretic Models Of Polymorphism – Thierry Coquand, Carl A. Gunter, Glynn Winskel - 1989
141 The system F of variable types, fifteen years later. Theoretical Computer Science 45 – J-Y Girard - 1986
59 Lambda definability in the full type hierarchy – Gordon Plotkin - 1980
44 A generalization of the functorial calculus – S EILENBERG, G M KELLY - 1966
210 Closed categories – S Eilenberg, G M Kelly - 1966
921 Categories for the working mathematician – Saunders Mac Lane - 1998