-
2
-
-
24944450386
-
Filters on coinductive streams, an application to Eratosthenes' sieve
-
Typed Lambda Calculi and Applications (TLCA'05), Springer-Verlag
-
Y. Bertot. Filters on coinductive streams, an application to Eratosthenes' sieve. In Typed Lambda Calculi and Applications (TLCA'05), volume 3461 of LNCS, pages 102-115. Springer-Verlag, 2005.
-
(2005)
LNCS
, vol.3461
, pp. 102-115
-
-
Bertot, Y.1
-
4
-
-
0026992713
-
Inductive definitions, semantics and abstract interpretation
-
ACM Press
-
P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In 19th symp. Principles of Progr. Lang, pages 83-94. ACM Press, 1992.
-
(1992)
19th Symp. Principles of Progr. Lang
, pp. 83-94
-
-
Cousot, P.1
Cousot, R.2
-
5
-
-
0036849162
-
Recursive subtyping revealed
-
V. Gapeyev, M. Levin, and B. Pierce. Recursive subtyping revealed. J. Func. Progr., 12(6):511-548, 2003.
-
(2003)
J. Func. Progr.
, vol.12
, Issue.6
, pp. 511-548
-
-
Gapeyev, V.1
Levin, M.2
Pierce, B.3
-
6
-
-
84948168202
-
Codifying guarded definitions with recursive schemes
-
Types for Proofs and Programs. International Workshop TYPES '94, Springer-Verlag
-
E. Giménez. Codifying guarded definitions with recursive schemes. In Types for Proofs and Programs. International Workshop TYPES '94, volume 996 of LNCS, pages 39-59. Springer-Verlag, 1994.
-
(1994)
LNCS
, vol.996
, pp. 39-59
-
-
Giménez, E.1
-
9
-
-
0042402546
-
A proof-theoretic assessment of runtime type errors
-
AT&T Bell Laboratories
-
C. A. Gunter and D. Rémy. A proof-theoretic assessment of runtime type errors. Research Report 11261-921230-43TM, AT&T Bell Laboratories, 1993.
-
(1993)
Research Report 11261-921230-43TM
-
-
Gunter, C.A.1
Rémy, D.2
-
10
-
-
0032396220
-
Functional runtimes within the lambda-sigma calculus
-
T. Hardin, L. Maranget, and B. Pagano. Functional runtimes within the lambda-sigma calculus. Journal of Functional Programming, 8(2):131-176, 1998.
-
(1998)
Journal of Functional Programming
, vol.8
, Issue.2
, pp. 131-176
-
-
Hardin, T.1
Maranget, L.2
Pagano, B.3
-
11
-
-
0031096225
-
Infinitary lambda calculus
-
R. Kennaway, J. W. Klop, M. R. Sleep, and F.-J. de Vries. Infinitary lambda calculus. Theor. Comp. Sci., 175(1):93-125, 1997.
-
(1997)
Theor. Comp. Sci.
, vol.175
, Issue.1
, pp. 93-125
-
-
Kennaway, R.1
Klop, J.W.2
Sleep, M.R.3
De Vries, F.-J.4
-
12
-
-
26844580425
-
A machine-checked model for a Java-like language, virtual machine and compiler
-
Technical Report 0400001T.1, National ICT Australia, Mar. To appear
-
G. Klein and T. Nipkow. A machine-checked model for a Java-like language, virtual machine and compiler. Technical Report 0400001T.1, National ICT Australia, Mar. 2004. To appear in ACM TOPLAS.
-
(2004)
ACM TOPLAS
-
-
Klein, G.1
Nipkow, T.2
-
14
-
-
33745802808
-
Formal certification of a compiler back-end, or: Programming a compiler with a proof assistant
-
ACM Press
-
X. Leroy. Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In 33rd symp. Principles of Progr. Lang, pages 42-54. ACM Press, 2006.
-
(2006)
33rd Symp. Principles of Progr. Lang
, pp. 42-54
-
-
Leroy, X.1
-
15
-
-
84982921576
-
Security properties of typed applets
-
J. Vitek and C. Jensen, editors, Secure Internet Programming - Security issues for Mobile and Distributed Objects, Springer-Verlag
-
X. Leroy and F. Rouaix. Security properties of typed applets. In J. Vitek and C. Jensen, editors, Secure Internet Programming - Security issues for Mobile and Distributed Objects, volume 1603 of LNCS, pages 147-182. Springer-Verlag, 1999.
-
(1999)
LNCS
, vol.1603
, pp. 147-182
-
-
Leroy, X.1
Rouaix, F.2
-
16
-
-
0026222092
-
Co-induction in relational semantics
-
R. Milner and M. Tofte. Co-induction in relational semantics. Theor. Comp. Sci., 87:209-220, 1991.
-
(1991)
Theor. Comp. Sci.
, vol.87
, pp. 209-220
-
-
Milner, R.1
Tofte, M.2
-
18
-
-
19144363748
-
An operational semantics framework supporting the incremental construction of derivation trees
-
Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II), Elsevier
-
A. Stoughton. An operational semantics framework supporting the incremental construction of derivation trees. In Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II), volume 12 of Electronic Notes in Theoretical Computer Science. Elsevier, 1998.
-
(1998)
Electronic Notes in Theoretical Computer Science
, vol.12
-
-
Stoughton, A.1
-
19
-
-
33745779926
-
Compiler verification for C0
-
Université Paul Sabatier, Toulouse, April
-
M. Strecker. Compiler verification for C0. Technical report, Université Paul Sabatier, Toulouse, April 2005.
-
(2005)
Technical Report
-
-
Strecker, M.1
-
20
-
-
0003025818
-
A syntactic approach to type soundness
-
A. K. Wright and M. Felleisen. A syntactic approach to type soundness. Inf. and Comp., 115(1):38-94, 1994.
-
(1994)
Inf. and Comp.
, vol.115
, Issue.1
, pp. 38-94
-
-
Wright, A.K.1
Felleisen, M.2
|