-
1
-
-
84954409394
-
A fully abstract game semantics for general references
-
IEEE
-
S. Abramsky, K. Honda, and G. McCusker. A fully abstract game semantics for general references. In 13th LICS, pages 334-344. IEEE, 1998.
-
(1998)
13th LICS
, pp. 334-344
-
-
Abramsky, S.1
Honda, K.2
McCusker, G.3
-
2
-
-
14644388877
-
A game semantics for generic polymorphism
-
S. Abramsky and R. Jagadeesan. A game semantics for generic polymorphism. Ann. Pure Appl. Logic, 133(1-3):3-37, 2005.
-
(2005)
Ann. Pure Appl. Logic
, vol.133
, Issue.1-3
, pp. 3-37
-
-
Abramsky, S.1
Jagadeesan, R.2
-
3
-
-
33745781693
-
Step-indexed syntactic logical relations for recursive and quantified types
-
15th ESOP, of
-
A. J. Ahmed. Step-indexed syntactic logical relations for recursive and quantified types. In 15th ESOP, volume 3924 of LNCS, pages 69-83, 2006.
-
(2006)
LNCS
, vol.3924
, pp. 69-83
-
-
Ahmed, A.J.1
-
4
-
-
28844437976
-
Genericity and the Pi-Calculus
-
December
-
M. Berger, K. Honda, and N. Yoshida. Genericity and the Pi-Calculus. Acta Informatica, 42(2):83-141, December 2005.
-
(2005)
Acta Informatica
, vol.42
, Issue.2
, pp. 83-141
-
-
Berger, M.1
Honda, K.2
Yoshida, N.3
-
6
-
-
0003367691
-
Direct models of the computational lambda-calculus
-
C. Führmann. Direct models of the computational lambda-calculus. ENTCS, 20:147-172, 1999.
-
(1999)
ENTCS
, vol.20
, pp. 147-172
-
-
Führmann, C.1
-
7
-
-
33846512236
-
Operational equivalences for untyped and polymorphic object calculi
-
A. D. Gordon and A. M. Pitts, editors, Cambridge U.P
-
A. D. Gordon. Operational equivalences for untyped and polymorphic object calculi. In A. D. Gordon and A. M. Pitts, editors, Higher Order Operational Techniques in Semantics. Cambridge U.P., 1998.
-
Higher Order Operational Techniques in Semantics
, pp. 1998
-
-
Gordon, A.D.1
-
8
-
-
0030686256
-
Games and definability for system F
-
IEEE
-
D. J. D. Hughes. Games and definability for system F. In 12th LICS, pages 76-86. IEEE, 1997.
-
(1997)
12th LICS
, pp. 76-86
-
-
Hughes, D.J.D.1
-
9
-
-
0034672932
-
-
J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II, and III. Inf. and Comp., 163(2):285-408, 2000.
-
J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II, and III. Inf. and Comp., 163(2):285-408, 2000.
-
-
-
-
10
-
-
38049027176
-
A fully abstract trace semantics for general references
-
34th ICALP, of, Springer
-
J. Laird. A fully abstract trace semantics for general references. In 34th ICALP, volume 4596 of LNCS, pages 667-679. Springer, 2007.
-
(2007)
LNCS
, vol.4596
, pp. 667-679
-
-
Laird, J.1
-
11
-
-
4244182304
-
Relational Reasoning about Functions and Nondeterminism
-
PhD thesis, Department of Computer Science, University of Aarhus, Dec
-
S. B. Lassen. Relational Reasoning about Functions and Nondeterminism. PhD thesis, Department of Computer Science, University of Aarhus, Dec. 1998. BRICS Dissertation Series DS-98-2.
-
(1998)
BRICS Dissertation Series DS
, vol.98 -2
-
-
Lassen, S.B.1
-
12
-
-
26844560861
-
Eager normal form bisimulation
-
IEEE
-
S. B. Lassen. Eager normal form bisimulation. In 20th LICS, pages 345-354. IEEE, 2005.
-
(2005)
20th LICS
, pp. 345-354
-
-
Lassen, S.B.1
-
13
-
-
34547357338
-
Head normal form bisimulation for pairs and the λμ-calculus (extended abstract)
-
IEEE
-
S. B. Lassen. Head normal form bisimulation for pairs and the λμ-calculus (extended abstract). In 21st LICS, pages 297-306. IEEE, 2006.
-
(2006)
21st LICS
, pp. 297-306
-
-
Lassen, S.B.1
-
14
-
-
38049005899
-
Typed normal form bisimulation
-
16th CSL, of, Springer
-
S. B. Lassen and P. B. Levy. Typed normal form bisimulation. In 16th CSL, volume 4646 of LNCS, pages 283-297. Springer, 2007.
-
(2007)
LNCS
, vol.4646
, pp. 283-297
-
-
Lassen, S.B.1
Levy, P.B.2
-
17
-
-
0027910769
-
The genericity theorem and parametricity in the polymorphic A-calculus
-
6 Dec
-
G. Longo, K. Milsted, and S. Soloviev. The genericity theorem and parametricity in the polymorphic A-calculus. Theoretical Computer Science, 121(1-2):323-349, 6 Dec. 1993.
-
(1993)
Theoretical Computer Science
, vol.121
, Issue.1-2
, pp. 323-349
-
-
Longo, G.1
Milsted, K.2
Soloviev, S.3
-
18
-
-
84888884278
-
Evolving games and essential nets for affine polymorphism
-
TLCA, of, Springer
-
A. Murawski and L. Ong. Evolving games and essential nets for affine polymorphism. In TLCA, volume 2044 of LNCS. Springer, 2001.
-
(2001)
LNCS
, vol.2044
-
-
Murawski, A.1
Ong, L.2
-
19
-
-
0000233772
-
Behavioral equivalence in the polymorphic pi-calculus
-
B. Pierce and D. Sangiorgi. Behavioral equivalence in the polymorphic pi-calculus. J. ACM, 47(3):531-584, 2000.
-
(2000)
J. ACM
, vol.47
, Issue.3
, pp. 531-584
-
-
Pierce, B.1
Sangiorgi, D.2
-
20
-
-
33745200491
-
Typed operational reasoning
-
B. C. Pierce, editor, chapter 7, The MIT Press
-
A. M. Pitts. Typed operational reasoning. In B. C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 7, pages 245-289. The MIT Press, 2005.
-
(2005)
Advanced Topics in Types and Programming Languages
, pp. 245-289
-
-
Pitts, A.M.1
-
22
-
-
0020919435
-
Types, abstraction and parametric polymorphism
-
J. C. Reynolds. Types, abstraction and parametric polymorphism. Information Processing, 83:513-523, 1983.
-
(1983)
Information Processing
, vol.83
, pp. 513-523
-
-
Reynolds, J.C.1
-
23
-
-
38049064319
-
A complete, co-inductive syntactic theory of sequential control and state
-
ACM
-
K. Støvring and S. B. Lassen. A complete, co-inductive syntactic theory of sequential control and state. In 34th POPL, pages 63-74. ACM, 2007.
-
(2007)
34th POPL
, pp. 63-74
-
-
Støvring, K.1
Lassen, S.B.2
-
24
-
-
35348948557
-
A bisimulation for type abstraction and recursion
-
E. Sumii and B. C. Pierce. A bisimulation for type abstraction and recursion. J. ACM, 54(5), 2007.
-
(2007)
J. ACM
, vol.54
, Issue.5
-
-
Sumii, E.1
Pierce, B.C.2
|