-
1
-
-
84974356026
-
Explicit substitutions
-
Martin Abadi, Luca Cardelli, Pierre-Louis Curien, and Jean-Jaques Levy. Explicit substitutions. Journal of Functional Programming, 1 (4):375-416, 1991.
-
(1991)
Journal of Functional Programming
, vol.1
, Issue.4
, pp. 375-416
-
-
Abadi, M.1
Cardelli, L.2
Curien, P.-L.3
Levy, J.-J.4
-
2
-
-
0030371868
-
Xu, a calculus of explicit substitutions which preserves strong normalisation
-
Z.-E.A. Benaissa, D. Briaud, P. Lescanne, and J. Rouyer-Degli. Xu, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming, 6(5), 1996.
-
(1996)
Journal of Functional Programming
, vol.6
, Issue.5
-
-
Benaissa, Z.-E.A.1
Briaud, D.2
Lescanne, P.3
Rouyer-degli, J.4
-
4
-
-
0003076755
-
Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection
-
R. Bloo and K.H. Rose. Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection. In Proc. CSN’95-Computer-Science in the Netherlands, pages 62-72, 1995.
-
(1995)
Proc. CSN’95-Computer-Science in the Netherlands
, pp. 62-72
-
-
Bloo, R.1
Rose, K.H.2
-
5
-
-
0030101783
-
Confluence properties of weak and strong calculi of explicit substitutions
-
March
-
P.-L. Curien, Th. Hardin, and J.-J.Levy. Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM, 43:362-397, March 1996.
-
(1996)
Journal of the ACM
, vol.43
, pp. 362-397
-
-
Curien, P.-L.1
Hardin, T.2
Levy, J.-J.3
-
7
-
-
17044403998
-
λ-calculi with explicit substitutions and compositions which preserve β-strong normalization (extended abstract)
-
Lecture Notes in Computer Science
-
M.C. Ferreira, D. Kesner, and L. Puel. λ-calculi with explicit substitutions and compositions which preserve β-strong normalization (extended abstract). In Proc. of 5th Int. Conf. on Algebraic and Logic Programming (ALP), volume 1139 of Lecture Notes in Computer Science, pages 248-298, 1996.
-
(1996)
Proc. of 5th Int. Conf. on Algebraic and Logic Programming (ALP)
, vol.1139
, pp. 248-298
-
-
Ferreira, M.C.1
Kesner, D.2
Puel, L.3
-
8
-
-
0004004014
-
Adjoint Rewriting
-
University of Edinburgh
-
N. Ghani. Adjoint Rewriting. PhD thesis, University of Edinburgh, 1995.
-
(1995)
PhD thesis
-
-
Ghani, N.1
-
9
-
-
0024700458
-
Thérèse Hardin. Confluence results for the pure strong categorical logic CCL. λ- calculi as subsystems of CCL
-
Thérèse Hardin. Confluence results for the pure strong categorical logic CCL. λ- calculi as subsystems of CCL. Theoretical Computer Science, 65:291-342, 1989.
-
(1989)
Theoretical Computer Science
, vol.65
, pp. 291-342
-
-
-
10
-
-
3042885673
-
Extending a lambda-calculus with explicit substitutions which preserves strong normalisation into a confluent calculus on open terms
-
F. Kamareddine and A. Rios. Extending a lambda-calculus with explicit substitutions which preserves strong normalisation into a confluent calculus on open terms. Journal of Functional Programming, 7 (4):395-420, 1997.
-
(1997)
Journal of Functional Programming
, vol.7
, Issue.4
, pp. 395-420
-
-
Kamareddine, F.1
Rios, A.2
-
11
-
-
84949250360
-
Two equivalent calculi of explicit substitution with confluence on meta-terms and preservation of strong normalisation (one with names and one first order)
-
F. Lang and K.H. Rose. Two equivalent calculi of explicit substitution with confluence on meta-terms and preservation of strong normalisation (one with names and one first order). In Proc. of Westapp’98, 1998.
-
(1998)
Proc. of Westapp’98
-
-
Lang, F.1
Rose, K.H.2
-
12
-
-
84947445610
-
Typed λ-calculi with explicit substitution may not terminate
-
LNCS 902
-
P.-A. Mellies. Typed λ-calculi with explicit substitution may not terminate. In Proc. of TLCA’95, pages 328-334. LNCS 902, 1995.
-
(1995)
Proc. of TLCA’95
, pp. 328-334
-
-
Mellies, P.-A.1
-
13
-
-
0029724783
-
Confluence and preservation of strong normalisation in an explicit substitution calculus
-
C. Munoz. Confluence and preservation of strong normalisation in an explicit substitution calculus. In Proc. of 11th IEEE Symp. on Logic in Computer Science, pages 440-447, 1996.
-
(1996)
Proc. of 11th IEEE Symp. on Logic in Computer Science
, pp. 440-447
-
-
Munoz, C.1
-
14
-
-
84864622674
-
On explicit substitution and names (extended abstract)
-
LNCS 1256
-
E. Ritter and V. de Paiva. On explicit substitution and names (extended abstract). In Proc. of ICALP’97, LNCS 1256, pages 248-258, 1997.
-
(1997)
Proc. of ICALP’97
, pp. 248-258
-
-
Ritter, E.1
de Paiva, V.2
|