850 search results - page 116 / 170 » A Logic Programming Language Based on Binding Algebras |
102
click to vote
ESOP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
102
click to vote
KR
1994
Springer
15 years 5 months ago
1994
Springer
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...
116
click to vote
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
109
click to vote
FOSSACS
2010
Springer
15 years 8 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
104
click to vote
AMAST
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...