3323 search results - page 145 / 665 » Computational Semantics with Functional Programming |
167
click to vote
AGP
1996
IEEE
15 years 9 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
147
click to vote
PPDP
2009
Springer
15 years 11 months ago
2009
Springer
Traversal strategies are at the heart of transformational programming with rewriting-based frameworks such as Stratego/XT or Tom and specific approaches for generic functional pr...
159
click to vote
LICS
2005
IEEE
15 years 10 months ago
2005
IEEE
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heap...
135
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
141
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...