3738 search results - page 452 / 748 » Parametrized Logic Programming |
115
click to vote
LPNMR
1990
Springer
15 years 7 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
119
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on t...
259
click to vote
POPL
2007
ACM
16 years 3 months ago
2007
ACM
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
111
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We describe a monadic interface to low-level hardware features that is a suitable basis for building operating systems in Haskell. The interface includes primitives for controllin...
121
click to vote
ICFP
2002
ACM
16 years 3 months ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...