164 search results - page 2 / 33 » Executable Computational Logics: Combining Formal Methods an... |
TLCA
2007
Springer
13 years 11 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
ASWEC
2005
IEEE
13 years 10 months ago
2005
IEEE
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
PPDP
2007
Springer
13 years 11 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
DATE
2004
IEEE
13 years 8 months ago
2004
IEEE
System level modeling with executable languages such as C/C++ has been crucial in the development of large electronic systems from general processors to application specific desig...
ICLP
1990
Springer
13 years 9 months ago
1990
Springer
The logic programming language framework Kernel Andorra Prolog is de ned by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive langu...