636 search results - page 55 / 128 » Operational Semantics for Functional Logic Languages |
144
Voted
ENTCS
2007
15 years 3 months ago
2007
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
111
Voted
IANDC
2006
15 years 3 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
153
click to vote
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
120
Voted
ICLP
2005
Springer
15 years 9 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 ...
128
Voted
TLDI
2009
ACM
16 years 18 days ago
2009
ACM
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...