by Ekkehard Rohwedder, Frank Pfenning
In Hanne Riis Nielson, editor, Proceedings of the European Symposium on Programming
http://pecan.srv.cs.cmu.edu/afs/cs.cmu.edu/user/fp/www/papers/esop96.ps.gz
Add To MetaCart
Abstract:
Abstract. We consider how mode (such as input and output) and termination properties of typed higher-order constraint logic programming languages may be declared and checked effectively. The systems that we present have been validated through an implementation and numerous case studies. 1
Citations
|
530
|
A framework for defining logics
– Harper, Honsell, et al.
- 1993
|
|
263
|
A logic programming language with lambda-abstraction, function variables, and simple unification
– Miller
- 1991
|
|
246
|
Abstract interpretation and application to logic programs
– Cousot, Cousot
- 1992
|
|
192
|
An Overview of �Prolog
– Nadathur, Miller
- 1988
|
|
182
|
Logic programming in the LF logical framework
– Pfenning
- 1991
|
|
119
|
Reasoning about termination of pure PROLOG programs
– Apt, Pedreschi
- 1993
|
|
95
|
Unification under a mixed prefix
– Miller
- 1992
|
|
68
|
Automatic Mode Inference for Logic Programs
– Debray, Warren
- 1988
|
|
68
|
Termination Proofs for Logic Programs
– Plumer
- 1988
|
|
67
|
D.: An Overview of λProlog
– Nadathur, Miller
- 1988
|
|
53
|
Implementing Prolog − Compiling Predicate Logic Programs
– Warren
- 1977
|
|
44
|
Natural semantics and some of its meta-theory in Elf
– Michaylov, Pfenning
- 1991
|
|
44
|
Structural cut elimination
– Pfenning
- 1994
|
|
41
|
Refinement types for logical frameworks
– Pfenning
- 1993
|
|
40
|
Elf: A meta-language for deductive systems
– Pfenning
- 1994
|
|
38
|
The automatic generation of mode declarations for Prolog programs
– Mellish
- 1981
|
|
36
|
Compiler verification in LF
– Hannan, Pfenning
- 1992
|
|
36
|
The Implementation of ALF--A Proof Editor Based on MartinL"of 's Monomorphic Type Theory with Explicit Substitution
– Magnusson
- 1995
|
|
33
|
Implementing the Meta-Theory of Deductive Systems
– Pfenning, Rohwedder
- 1992
|
|
30
|
Structural cut elimination in linear logic
– Pfenning
- 1994
|
|
25
|
Abstract syntax and logic programming
– Miller
- 1992
|
|
22
|
A system of precise modes for logic programs
– Somogyi
- 1987
|
|
19
|
Strict functionals for termination proofs
– Pol, Schwichtenberg
- 1995
|
|
13
|
Towards a domain theory for termination proofs
– Kahrs
- 1995
|
|
12
|
A typed foundation for directional logic programming
– Reddy
- 1993
|
|
11
|
The declarative semantics of the Prolog selection rule
– Stärk
- 1994
|
|
8
|
On the occur-check-free Prolog programs
– Apt, Pellegrini
- 1994
|
|
6
|
Automatic Generation of Control for Logic Programs
– Naish
- 1983
|
|
4
|
Higher-order superposition for dependent types
– Virga
- 1995
|
|
1
|
A pragmatic view of types for logic programs
– Jacobs
- 1992
|
