-
2
-
-
0028762192
-
A feature constraint system for logic programming with entailment
-
H. Ait-Kaci, A. Podelski, and G. Smolka. A feature constraint system for logic programming with entailment. Theoretical Computer Science, 122(1-2):263-283, 1994.
-
(1994)
Theoretical Computer Science
, vol.122
, Issue.1-2
, pp. 263-283
-
-
Ait-Kaci, H.1
Podelski, A.2
Smolka, G.3
-
3
-
-
84874257101
-
An overview of ELAN
-
volume 15. Electronic Notes in Theoretical Computer Science
-
P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and C. Ringeissen. An overview of ELAN. In Proc. of WRLA, volume 15. Electronic Notes in Theoretical Computer Science, 1998.
-
(1998)
Proc. of WRLA
-
-
Borovanský, P.1
Kirchner, C.2
Kirchner, H.3
Moreau, P.-E.4
Ringeissen, C.5
-
4
-
-
0024130791
-
Combining algebra and higher-order types
-
V. Breazu-Tannen. Combining algebra and higher-order types. In Proc. of LICS, pages 82-90, 1988.
-
(1988)
Proc. of LICS
, pp. 82-90
-
-
Breazu-Tannen, V.1
-
5
-
-
0041805676
-
Matching - A special case of unification?
-
H.-J. Bürckert. Matching - A special case of unification? Journal of Symbolic Computation, 8(5):523-536, 1989.
-
(1989)
Journal of Symbolic Computation
, vol.8
, Issue.5
, pp. 523-536
-
-
Bürckert, H.-J.1
-
9
-
-
0009903219
-
The rho cube
-
volume 2030 of LNCS, Springer-Verlag
-
H. Cirstea, C. Kirchner, and L. Liquori. The Rho Cube. In Proc. of FOSSACS, volume 2030 of LNCS, pages 166-180. Springer-Verlag, 2001.
-
(2001)
Proc. of FOSSACS
, pp. 166-180
-
-
Cirstea, H.1
Kirchner, C.2
Liquori, L.3
-
10
-
-
19144364639
-
Principles of maude
-
volume 4. Electronic Notes in Theoretical Computer Science
-
M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In Proc. of WRLA, volume 4. Electronic Notes in Theoretical Computer Science, 1996.
-
(1996)
Proc. of WRLA
-
-
Clavel, M.1
Eker, S.2
Lincoln, P.3
Meseguer, J.4
-
12
-
-
0013275449
-
Third order matching is decidable
-
G. Dowek. Third order matching is decidable. Annals of Pure and Applied Logic, 69:135-155, 1994.
-
(1994)
Annals of Pure and Applied Logic
, vol.69
, pp. 135-155
-
-
Dowek, G.1
-
14
-
-
0001805715
-
A lambda calculus of objects and method specialization
-
K. Fisher, F. Honsell, and J. C. Mitchell. A Lambda Calculus of Objects and Method Specialization. Nordic Journal of Computing, 1(1):3-37, 1994.
-
(1994)
Nordic Journal of Computing
, vol.1
, Issue.1
, pp. 3-37
-
-
Fisher, K.1
Honsell, F.2
Mitchell, J.C.3
-
15
-
-
0031384225
-
An overview of CAFE specification environment - An algebraic approach for creating, verifying, and maintaining formal specifications over networks
-
K. Futatsugi and A. Nakagawa. An overview of CAFE specification environment - an algebraic approach for creating, verifying, and maintaining formal specifications over networks. In Proc. of FEM, 1997.
-
(1997)
Proc. of FEM
-
-
Futatsugi, K.1
Nakagawa, A.2
-
16
-
-
84976856364
-
Polymorphic rewriting conserves algebraic strong normalization and confluence
-
volume 372 of LNCS, Springer-Verlag
-
J. Gallier and V. Breazu-Tannen. Polymorphic rewriting conserves algebraic strong normalization and confluence. In Proc. of ICALP, volume 372 of LNCS, pages 137- 150. Springer-Verlag, 1989.
-
(1989)
Proc. of ICALP
, pp. 137-150
-
-
Gallier, J.1
Breazu-Tannen, V.2
-
17
-
-
0006263849
-
A lambda calculus of objects with self-inflicted extension
-
The ACM Press
-
P. Di Gianantonio, F. Honsell, and L. Liquori. A Lambda Calculus of Objects with Self-inflicted Extension. In Proc. of OOPSLA, pages 166-178. The ACM Press, 1998.
-
(1998)
Proc. of OOPSLA
, pp. 166-178
-
-
Di Gianantonio, P.1
Honsell, F.2
Liquori, L.3
-
18
-
-
85032209792
-
An introduction to OBJ-3
-
volume 308 of LNCS, Springer-Verlag
-
J. A. Goguen, C. Kirchner, H. Kirchner, A. Megrelis, J. Meseguer, and T. Winkler. An introduction to OBJ-3. In Proc. of CTRS, volume 308 of LNCS, pages 258-263. Springer-Verlag, 1987.
-
(1987)
Proc. of CTRS
, pp. 258-263
-
-
Goguen, J.A.1
Kirchner, C.2
Kirchner, H.3
Megrelis, A.4
Meseguer, J.5
Winkler, T.6
-
20
-
-
0018050926
-
Proving and applying program transformations expressed with second-order patterns
-
G. Huet and B. Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31-55, 1978
-
(1978)
Acta Informatica
, vol.11
, pp. 31-55
-
-
Huet, G.1
Lang, B.2
-
21
-
-
0000419540
-
Associative-commutative pattern matching
-
J.-M. Hullot. Associative-commutative pattern matching. In Proc. of IJCAI, 1979.
-
(1979)
Proc. of IJCAI
-
-
Hullot, J.-M.1
-
24
-
-
0002563907
-
Designing constraint logic programming languages using computational systems
-
chapter 8, The MIT press
-
C. Kirchner, H. Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In Principles and Practice of Constraint Programming. The Newport Papers., chapter 8, pages 131-158. The MIT press, 1995.
-
(1995)
Principles and Practice of Constraint Programming. The Newport Papers
, pp. 131-158
-
-
Kirchner, C.1
Kirchner, H.2
Vittek, M.3
-
26
-
-
0000904908
-
Fast pattern matching in strings
-
Donald E. Knuth, J. Morris, and V. Pratt. Fast pattern matching in strings. SIAM Journal of Computing, 6(2):323-350, 1977.
-
(1977)
SIAM Journal of Computing
, vol.6
, Issue.2
, pp. 323-350
-
-
Donald, E.1
Morris, K.J.2
Pratt, V.3
-
27
-
-
85034635567
-
Lazy pattern matching in the ML language
-
volume 287 of LNCS, Springer-Verlag
-
A. Laville. Lazy pattern matching in the ML language. In Proc. FCT & TCS, volume 287 of LNCS, pages 400-419. Springer-Verlag, 1987.
-
(1987)
Proc. FCT & TCS
, pp. 400-419
-
-
Laville, A.1
-
28
-
-
85032177635
-
A logic programming language with lambda-abstraction, function variables, and simple unification
-
volume 475 of LNCS, Springer-Verlag
-
D Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. In Proc. of ELP, volume 475 of LNCS, pages 253-281. Springer-Verlag, 1991.
-
(1991)
Proc. of ELP
, pp. 253-281
-
-
Miller, D.1
-
29
-
-
0038519012
-
Higher-order rewriting and equational reasoning
-
W. Bibel and P. Schmitt, editors, Volume I: Foundations Kluwer
-
Tobias Nipkow and Christian Prehofer. Higher-order rewriting and equational reasoning. In W. Bibel and P. Schmitt, editors, Automated Deduction - A Basis for Applications. Volume I: Foundations. Kluwer, 1998.
-
(1998)
Automated Deduction - A Basis for Applications
-
-
Nipkow, T.1
Prehofer, C.2
-
30
-
-
85028762708
-
Strong normalizability for the combined system of the typed λ calculus and an arbitrary convergent term rewrite system
-
ACM Press
-
M. Okada. Strong normalizability for the combined system of the typed λ calculus and an arbitrary convergent term rewrite system. In Proc. of ISSAC, pages 357- 363. ACM Press, 1989.
-
(1989)
Proc. of ISSAC
, pp. 357-363
-
-
Okada, M.1
-
32
-
-
84976823860
-
Complete sets of reductions for some equational theories
-
G. Peterson and M. E. Stickel. Complete sets of reductions for some equational theories. Journal of the ACM, 28:233-264, 1981.
-
(1981)
Journal of the ACM
, vol.28
, pp. 233-264
-
-
Peterson, G.1
Stickel, M.E.2
-
34
-
-
0009774026
-
-
Équipe Protheo. The Elan Home Page, 2001. http://elan.loria.fr.
-
(2001)
The Elan Home Page
-
-
-
36
-
-
0037842587
-
Lambda calculus with patterns
-
Vrije Universiteit, November
-
V. van Oostrom. Lambda calculus with patterns. Technical Report IR-228, Vrije Universiteit, November 1990.
-
(1990)
Technical Report IR-228
-
-
Van Oostrom, V.1
-
37
-
-
0003363397
-
Input/output for ELAN
-
volume 4. Electronic Notes in Theoretical Computer Science
-
P. Viry. Input/Output for ELAN. In Proc. of WRLA, volume 4. Electronic Notes in Theoretical Computer Science, 1996.
-
(1996)
Proc. of WRLA
-
-
Viry, P.1
-
38
-
-
84874275328
-
A core language for rewriting
-
volume 15. Electronic Notes in Theoretical Computer Science
-
E. Visser and Z.e.A. Benaissa. A core language for rewriting. In Proc. of WRLA, volume 15. Electronic Notes in Theoretical Computer Science, 1998.
-
(1998)
Proc. of WRLA
-
-
Visser, E.1
Benaissa, Z.E.A.2
-
39
-
-
0004154865
-
-
volume 21 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press
-
D. A. Wolfram. The Clausal Theory of Types, volume 21 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1993.
-
(1993)
The Clausal Theory of Types
-
-
Wolfram, D.A.1
|