330 search results - page 55 / 66 » On Modular Termination Proofs of General Logic Programs |
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
DAGSTUHL
1996
13 years 9 months ago
1996
Recently, considerable advances have been made in the (on-line) control of logic program specialisation. A clear conceptual distinction has been established between local and glob...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
ICALP
2010
Springer
14 years 20 days ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...