Sciweavers

90 search results - page 13 / 18
» Free theorems for functional logic programs
Sort
View
CORR
2002
Springer
141views Education» more  CORR 2002»
14 years 10 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
ACL2
2006
ACM
15 years 4 months ago
Reasoning about ACL2 file input
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about filereading operations. We develop a low level library for re...
Jared Davis
ENTCS
2007
105views more  ENTCS 2007»
14 years 10 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
ICFP
2002
ACM
15 years 10 months ago
Meta-programming with names and necessity
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...
Aleksandar Nanevski
AGP
1999
IEEE
15 years 2 months ago
The Relative Complement Problem for Higher-Order Patterns
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
Alberto Momigliano, Frank Pfenning