(Enter summary)
Abstract: Wedevelop an effective model for higher-order functional-logic programming by
refining higher-order narrowing calculi. The refinements reduce the high degree
of non-determinism in narrowing calculi, utilizing properties of functional(-logic)
programs. These include convergent and left-linear rewrite rules. All refinements
can be combined to a narrowing strategy which generalizes call-by-need as in
functional programming. Furthermore, we consider conditional rewrite rules
which are often... (Update)
Cited by: More
Higher-Order Equational Logic - Prehofer (1997)
(Correct)
Similar documents (at the sentence level): More
78.9%: Higher-Order Functional-Logic Programming: A Systematic Development - Prehofer (1997)
(Correct)
27.1%: A Call-by-Need Strategy for Higher-Order Functional-Logic.. - Prehofer (1995)
(Correct)
16.3%: Solving Higher-Order Equations: From Logic to Programming - Prehofer (1995)
(Correct)
Active bibliography (related documents): More All
0.4: Higher-Order Narrowing - Prehofer (1994)
(Correct)
0.2: Final CCL report - Jouannaud
(Correct)
0.2: Curry: A Truly Functional Logic Language - Hanus, Kuchen, Moreno-Navarro (1995)
(Correct)
Similar documents based on text: More All
0.3: Higher-Order Proof by Consistency - Henrik Linnestad Olav (1996)
(Correct)
0.2: Feature-Oriented Programming: A Fresh Look at Objects - Prehofer (1997)
(Correct)
0.2: An Object-Oriented Approach to Feature Interaction - Prehofer (1997)
(Correct)
BibTeX entry: (Update)
C. Prehofer. Higher-order functional-logic programming: A systematic development (invited talk). In Proc. of the Second Fuji International Workshop on Functional and Logic Programming. World Scientific, 1997. C. Prehofer, 6/97 Higher-Order Equational Logic 105 http://citeseer.ist.psu.edu/article/prehofer97higherorder.html More
@misc{ prehofer97higherorder,
author = "C. Prehofer",
title = "Higher-order functional-logic programming: A systematic development",
text = "C. Prehofer. Higher-order functional-logic programming: A systematic development
(invited talk). In Proc. of the Second Fuji International Workshop on Functional
and Logic Programming. World Scientific, 1997. C. Prehofer, 6/97 Higher-Order
Equational Logic 105",
year = "1997",
url = "citeseer.ist.psu.edu/article/prehofer97higherorder.html" }
Citations (may not include all citations):
788
Rewrite systems
- Dershowitz, Jouannaud - 1990
362
ML for the Working Programmer (context) - Paulson - 1991
254
The integration of functions into logic programming: From th.. (context) - Hanus - 1994
251
A logic programming language with lambda-abstraction
- Miller - 1991
172
Higher-order abstract syntax (context) - Pfenning, Elliott - 1988
169
A call-by-need lambda calculus
- Ariola, Felleisen et al. - 1995
137
Introduction to Combinators and -Calculus (context) - Hindley, Seldin - 1986
126
Higher-order critical pairs (context) - Nipkow - 1991
101
Higher-order logic programming
- Nadathur, Miller
56
Higher-order unification revisited: Complete sets of transfo.. (context) - Snyder, Gallier - 1989
44
Higher-order narrowing with definitional trees
- Hanus, Prehofer - 1996
35
Solving Higher-order Equations: From Logic to Programming
- Prehofer - 1995
34
Higher-order rewrite systems and their confluence
- Mayr, Nipkow
30
Field and Peter G (context) - Anthony - 1988
23
its Syntax and Semantics (context) - Barendregt, Calculus - 1984
23
Computations in orthogonal rewriting systems (context) - Huet, L'evy - 1991
22
Higher-order narrowing
- Prehofer - 1994
20
A Proof Theory for General Unification (context) - Snyder - 1991
20
A complete narrowing calculus for higher-order functional lo..
- Nakahara, Middeldorp et al. - 1995
19
Improving control of logic programs by using functional logi.. (context) - Hanus - 1992
18
Uses of higher-order unification for implementing program tr.. (context) - Hannan, Miller - 1988
17
Decidable higher-order unification problems
- Prehofer - 1994
17
Lazy unification with simplification
- Hanus - 1994
16
Proving and applying program transformations expressed with .. (context) - Huet, Lang - 1978
14
A Call-by-Need Strategy for Higher-Order Functional-Logic Pr..
- Prehofer - 1995
13
Higher-order conditional rewriting and narrowing (context) - Avenhaus, Lor'ia-S'aenz - 1994
12
Higher-order equational logic programming (context) - Qian - 1994
11
Higher Order Babel --- language and implementation
- Kuchen, Anastasiadis - 1996
11
An empirical study of the runtime behavior of higher-order l.. (context) - Pfenning - 1992
11
Combining functional and logic programming languages (context) - Lloyd - 1994
8
Higher-order narrowing with convergent systems
- Prehofer - 1995
6
The Implementation of Functional Logic Languages (context) - Lock - 1993
2
the completeness of narrowing as the operational semantics o.. (context) - Gonz'alez-Moreno, Hortal'a-Gonz'alez et al. - 1992
2
HIFUNLOG: Logic programming with higher-order relational fun.. (context) - Sheng - 1990
Documents on the same site (http://www4.in.tum.de/publ/papers/): More
The Amsterdam Manifesto on OCL - Cook, Kleppe, Mitchell, Rumpe.. (1999)
(Correct)
Structured Specifications and Implementation of.. - Walicki, Broy (1995)
(Correct)
Modeling Dynamic Component Interfaces - Huber, Rausch, Rumpe (1998)
(Correct)
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