-
1
-
-
84974295344
-
Equivalence in functional languages with effects
-
I. Mason and C. Talcott, "Equivalence in functional languages with effects," Journal of Functional Programming, vol. 1, pp. 287-327, 1991.
-
(1991)
Journal of Functional Programming
, vol.1
, pp. 287-327
-
-
Mason, I.1
Talcott, C.2
-
2
-
-
0003685579
-
Operational reasoning for functions with local state
-
A. Pitts and I. Stark, "Operational reasoning for functions with local state," in Higher Order Operational Techniques in Semantics, Proceedings, 1998, pp. 227-273.
-
Higher Order Operational Techniques in Semantics, Proceedings, 1998
, pp. 227-273
-
-
Pitts, A.1
Stark, I.2
-
4
-
-
0000230630
-
LCF considered as a programming language
-
G. Plotkin, "LCF considered as a programming language," Theoretical Computer Science, vol. 5, pp. 223-255, 1977.
-
(1977)
Theoretical Computer Science
, vol.5
, pp. 223-255
-
-
Plotkin, G.1
-
5
-
-
2942572885
-
A structural approach to operational semantics
-
-, "A structural approach to operational semantics," Journal of Logic and Algebraic Programming, vol. 60-61, pp. 17-139, 2004.
-
(2004)
Journal of Logic and Algebraic Programming
, vol.60-61
, pp. 17-139
-
-
Plotkin, G.1
-
7
-
-
84945259051
-
Adequacy for algebraic effects
-
G. Plotkin and J. Power, "Adequacy for algebraic effects," in Foundations of Software Science and Computation Structures, Proceedings, 2001, pp. 1-24.
-
Foundations of Software Science and Computation Structures, Proceedings, 2001
, pp. 1-24
-
-
Plotkin, G.1
Power, J.2
-
8
-
-
84948987061
-
Notions of computation determine monads
-
-, "Notions of computation determine monads," in Foundations of Software Science and Computation Structures, Proceedings, 2002, pp. 342-356.
-
Foundations of Software Science and Computation Structures, Proceedings, 2002
, pp. 342-356
-
-
Plotkin, G.1
Power, J.2
-
11
-
-
0001233777
-
Parametric polymorphism and operational equivalence
-
A. Pitts, "Parametric polymorphism and operational equivalence," Mathematical Structures in Computer Science, vol. 10, pp. 321-359, 2000.
-
(2000)
Mathematical Structures in Computer Science
, vol.10
, pp. 321-359
-
-
Pitts, A.1
-
13
-
-
0001862336
-
Fully abstract models of typed λ-calculi
-
R. Milner, "Fully abstract models of typed λ-calculi," Theoretical Computer Science, vol. 4, pp. 1-22, 1977.
-
(1977)
Theoretical Computer Science
, vol.4
, pp. 1-22
-
-
Milner, R.1
-
14
-
-
44649153132
-
Relational parametricity for computational effects
-
R. Møgelberg and A. Simpson, "Relational parametricity for computational effects," in Logic in Computer Science, Proceedings, 2007, pp. 346-355.
-
Logic in Computer Science, Proceedings, 2007
, pp. 346-355
-
-
Møgelberg, R.1
Simpson, A.2
-
16
-
-
35748935522
-
Selective strictness and parametricity in structural operational semantics, inequationally
-
J. Voigtländer and P. Johann, "Selective strictness and parametricity in structural operational semantics, inequationally," Theoretical Computer Science, vol. 388, pp. 290-318, 2007.
-
(2007)
Theoretical Computer Science
, vol.388
, pp. 290-318
-
-
Voigtländer, J.1
Johann, P.2
-
17
-
-
70350267543
-
A family of syntactic logical relations for the semantics of Haskell-like languages
-
P. Johann and J. Voigtländer, "A family of syntactic logical relations for the semantics of Haskell-like languages," Information and Computation, vol. 207, pp. 341-368, 2009.
-
(2009)
Information and Computation
, vol.207
, pp. 341-368
-
-
Johann, P.1
Voigtländer, J.2
-
18
-
-
0011122747
-
Structural operational semantics
-
Elsevier
-
L. Aceto, W. Fokkink, and C. Verhoef, "Structural operational semantics," in Handbook of Process Algebra. Elsevier, 2001, pp. 197-292.
-
(2001)
Handbook of Process Algebra
, pp. 197-292
-
-
Aceto, L.1
Fokkink, W.2
Verhoef, C.3
-
19
-
-
84885204671
-
Deriving bisimulation congruences for reactive systems
-
J. Leifer and R. Milner, "Deriving bisimulation congruences for reactive systems," in Conference on Concurrency Theory, Proceedings, 2000, pp. 243-258.
-
Conference on Concurrency Theory, Proceedings, 2000
, pp. 243-258
-
-
Leifer, J.1
Milner, R.2
-
20
-
-
0037028904
-
From rewrite rules to bisimulation congruences
-
P. Sewell, "From rewrite rules to bisimulation congruences," Theoretical Computer Science, vol. 274, pp. 183-230, 2002.
-
(2002)
Theoretical Computer Science
, vol.274
, pp. 183-230
-
-
Sewell, P.1
-
21
-
-
82755165784
-
Environmental bisimulations for higher-order languages
-
D. Sangiorgi, N. Kobayashi, and E. Sumii, "Environmental bisimulations for higher-order languages," in Logic in Computer Science, Proceedings, 2007, pp. 293-302.
-
Logic in Computer Science, Proceedings, 2007
, pp. 293-302
-
-
Sangiorgi, D.1
Kobayashi, N.2
Sumii, E.3
-
22
-
-
70350365548
-
A complete characterization of observational equivalence in polymorphic lambda-calculus with general references
-
E. Sumii, "A complete characterization of observational equivalence in polymorphic lambda-calculus with general references," in Computer Science Logic, Proceedings, 2009, pp. 455-469.
-
Computer Science Logic, Proceedings, 2009
, pp. 455-469
-
-
Sumii, E.1
-
23
-
-
33745348813
-
Combining effects: Sum and tensor
-
M. Hyland, G. Plotkin, and J. Power, "Combining effects: Sum and tensor," Theoretical Computer Science, vol. 357, pp. 70-99, 2006.
-
(2006)
Theoretical Computer Science
, vol.357
, pp. 70-99
-
-
Hyland, M.1
Plotkin, G.2
Power, J.3
|