1020 search results - page 134 / 204 » Tight Semantics for Logic Programs |
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
ENTCS
2008
15 years 3 months ago
2008
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
117
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
148
click to vote
POPL
2012
ACM
13 years 10 months ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
117
Voted
ICLP
2005
Springer
15 years 8 months ago
2005
Springer
Constraint Handling Rules (CHR) is a high-level rule-based language extension, commonly embedded in Prolog. We introduce a new occurrence representation of CHR programs, and a new ...