-
1
-
-
84888864342
-
A finitary subsystem of the polymorphic lambda-calculus
-
S. Abramsky, Ed. Lecture Notes in Computer Science, Springer-Verlag, New York
-
ALTENKIRCH, T. AND COQUAND, T. 2001. A finitary subsystem of the polymorphic lambda-calculus. In Typed Lambda Calculi and Applications, S. Abramsky, Ed. Lecture Notes in Computer Science, vol. 2044. Springer-Verlag, New York, 22-28.
-
(2001)
Typed Lambda Calculi and Applications
, vol.2044
, pp. 22-28
-
-
Altenkirch, T.1
Coquand, T.2
-
2
-
-
85007617019
-
Intuitionistic light affine logic
-
ASPERTI, A. AND ROVERSI, L. 2002. Intuitionistic light affine logic. ACM Trans. Comput. Logic 3, 1, 137-175.
-
(2002)
ACM Trans. Comput. Logic
, vol.3
, Issue.1
, pp. 137-175
-
-
Asperti, A.1
Roversi, L.2
-
3
-
-
33846259502
-
Computation models and function algebras
-
E. R. Griffor, Ed. Elsevier-North-Holland, Amsterdam, The Netherlands
-
CLOTE, P. 1999. Computation models and function algebras. In Handbook of Computability Theory, E. R. Griffor, Ed. Elsevier-North-Holland, Amsterdam, The Netherlands, 589-681.
-
(1999)
Handbook of Computability Theory
, pp. 589-681
-
-
Clote, P.1
-
4
-
-
0038147461
-
Linear logic and elementary time
-
DANOS, V. AND JOINET, J.-B. 2003. Linear logic and elementary time. Inf. Comput. 183, 1, 123-137.
-
(2003)
Inf. Comput.
, vol.183
, Issue.1
, pp. 123-137
-
-
Danos, V.1
Joinet, J.-B.2
-
5
-
-
77956953346
-
Une extension de l'interprétation de Gödel à l'analyse, et son application à l'élimination des coupures dans l'analyse et la théorie des types
-
J. Fenstad, Ed. North-Holland, Amsterdam, The Netherlands
-
GIRARD, J.-Y. 1971. Une extension de l'interprétation de Gödel à l'analyse, et son application à l'élimination des coupures dans l'analyse et la théorie des types. In Proceedings of the 2nd Scandinavian Logic Symposium, J. Fenstad, Ed. North-Holland, Amsterdam, The Netherlands, 63-92.
-
(1971)
Proceedings of the 2nd Scandinavian Logic Symposium
, pp. 63-92
-
-
Girard, J.-Y.1
-
6
-
-
0000130547
-
Light linear logic
-
GIRARD, J.-Y. 1998. Light linear logic. Inf. Comput. 143, 2, 175-204.
-
(1998)
Inf. Comput.
, vol.143
, Issue.2
, pp. 175-204
-
-
Girard, J.-Y.1
-
8
-
-
0003111227
-
Egyszeru példa eldönthetetlen aritmetikai problëmára
-
KALMÁR, L. 1943. Egyszeru példa eldönthetetlen aritmetikai problëmára. Matematikai és Fizikai Lapok 50, 1-23.
-
(1943)
Matematikai És Fizikai Lapok
, vol.50
, pp. 1-23
-
-
Kalmár, L.1
-
9
-
-
0026191658
-
Finitely stratified polymorphism
-
LEIVANT, D. 1991. Finitely stratified polymorphism. Inf. Comput. 93, 93-113.
-
(1991)
Inf. Comput.
, vol.93
, pp. 93-113
-
-
Leivant, D.1
-
10
-
-
84976827574
-
Towards a theory of type structure
-
Lecture Notes in Computer Science, Springer-Verlag, New York
-
REYNOLDS, J. 1974. Towards a theory of type structure. In Proceedings, Colloque sur la programmation. Lecture Notes in Computer Science, vol. 19. Springer-Verlag, New York, 408-425.
-
(1974)
Proceedings, Colloque sur la Programmation
, vol.19
, pp. 408-425
-
-
Reynolds, J.1
-
11
-
-
16644403320
-
Tiering as a recursion technique
-
to appear
-
SIMMONS, H. 2005. Tiering as a recursion technique. Bull. Symb. Logic, to appear.
-
(2005)
Bull. Symb. Logic
-
-
Simmons, H.1
|