342 search results - page 55 / 69 » Coalgebraic Symbolic Semantics |
FOSSACS
2009
Springer
14 years 4 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
OOPSLA
2005
Springer
14 years 3 months ago
2005
Springer
Representing programs as text strings makes programming harder then it has to be. The source text of a program is far removed from its behavior. Bridging this conceptual gulf is w...
OOPSLA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we explore the idea that the code that constitutes a program actually forms a higher-level, program specific language. The symbols of the language are the abstracti...
LPNMR
1997
Springer
14 years 2 months ago
1997
Springer
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
ICLP
2010
Springer
14 years 1 months ago
2010
Springer
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...