| Alternate document: Details Higher-Order Functional-Logic Programming: A Systematic Development (97) Christian Prehofer |
Christian Prehofer  Home/Search
Context
Related
| www4.informatik.tumue...cadetut.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: www4.informatik.tumuenchen.de... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Syntax" [Pfenning&Elliot 88] Applications: Programming languages, mathematics, formal systems ffl Higher-order theorem proving ffl Declarative Programming C. Prehofer, 6/97 Higher-Order Equational Logic 4 Declarative Programming Paradigms ? XXXXXXXXX Xz XXXXXXXXX Xz 9 9 ? Logic Programming Functional Programming Narrowing Higher-Order LP Higher-Order FP Higher-Order Narrowing C. Prehofer, 6/97 Higher-Order Equational Logic 5 Notation and Basic Definitions Variable... (Update)
Active bibliography (related documents): More All
0.8: Decidable Higher-Order Unification Problems - Prehofer (1994) (Correct)
0.5: Higher-Order Rewrite Systems and their Confluence - Mayr, Nipkow (Correct)
0.4: Higher-Order Functional-Logic Programming: A Systematic Development - Prehofer (1997) (Correct)
Similar documents based on text: More All
0.7: Higher-Order Narrowing - Prehofer (1994) (Correct)
0.5: Sound And Complete Translations From Sorted Higher-Order Logic.. - Kerber (1994) (Correct)
0.5: Higher-Order Lazy Narrowing Calculus: A Computation Model.. - Suzuki, Nakagawa, Ida (1997) (Correct)
BibTeX entry: (Update)
@misc{ prehofer-higherorder,
author = "Christian Prehofer",
title = "Higher-Order Equational Logic",
url = "citeseer.ist.psu.edu/prehofer97higherorder.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
505 Implementing Mathematics With the Nuprl Proof Development Sy.. - Constable, Allen et al. - 1986
294 Isabelle: A Generic Theorem Prover (context) - Paulson - 1994
254 The integration of functions into logic programming: From th.. (context) - Hanus - 1994
251 A logic programming language with lambda-abstraction - Miller - 1991
187 HOL: A proof generating system for higher-order logic (context) - Gordon - 1988
174 Combinatory Reduction Systems (context) - Klop - 1980
172 Higher-order abstract syntax (context) - Pfenning, Elliott - 1988
112 The Art of Prolog: Advanced Programming Techniques (context) - Sterling, Shapiro - 1986
101 Higher-order logic programming - Nadathur, Miller - 1995
97 The undecidability of the second-order unification problem (context) - Goldfarb - 1981
79 the Church-Rosser property for the direct sum of term rewrit.. (context) - Toyama - 1987
61 Higher-order unification via explicit substitutions - Dowek, Hardin et al. - 1995
57 Confluence for Abstract and Higher-Order Rewriting (context) - van Oostrom - 1994
56 Higher-order unification revisited: Complete sets of transfo.. (context) - Snyder, Gallier - 1989
44 Higher-order narrowing with definitional trees - Hanus, Prehofer - 1996
41 Interaction systems I: The theory of optimal reductions - Asperti, Laneve - 1991
37 The Coq proof assistant user's guide version (context) - Dowek, Felty et al. - 1993
37 Third order matching is decidable - Dowek - 1992
35 Solving Higher-order Equations: From Logic to Programming - Prehofer - 1995
34 Higher-order rewrite systems and their confluence - Mayr, Nipkow - 1997
31 Weak orthogonality implies confluence: the higher-order case (context) - van Oostrom, van Raamsdonk - 1994
30 The TPS theorem proving system (context) - Andrews, Issar et al. - 1990
26 Modularity of strong normalization and confluence in the alg.. - Barbanera, Fern'andez et al. - 1994
22 Higher-order narrowing - Prehofer - 1994
22 Higher-order families - van Oostrom - 1996
20 Comparing combinatory reduction systems and higher-order rew.. - van Oostrom, van Raamsdonk - 1994
19 calculi with conditional rules (context) - Takahashi - 1993
19 Termination proofs for higher-order rewrite systems - Pol - 1994
18 A termination ordering for higher order rewrite systems - Lysne, Piris - 1995
17 Decidable higher-order unification problems - Prehofer - 1994
16 Towards a domain theory for termination proofs (context) - Kahrs - 1995
14 A Call-by-Need Strategy for Higher-Order Functional-Logic Pr.. - Prehofer - 1995
8 Higher-order narrowing with convergent systems - Prehofer - 1995
8 On equivalence classes of interpolation equations (context) - Padovani - 1995
4 A recursive path ordering for higher-order terms in j-long f.. (context) - Jouannaud, Rubio - 1996
3 Analogical reasoning based on higher-order unification (context) - Harao - 1990
3 Learning and applying generalised solutions using higher ord.. (context) - Donat, Wallen - 1988
1 rd International Workshop on Termination (context) - Jouannaud, Rubio et al. - 1997
1 Higher-order functional-logic programming: A systematic deve.. - Prehofer - 1997
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC