80 search results - page 10 / 16 » A Procedural Semantics for Multi-adjoint Logic Programming |
123
Voted
ATVA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
148
click to vote
EMSOFT
2006
Springer
15 years 6 months ago
2006
Springer
Concurrent programming languages should be a good fit for embedded systems because they match the intrinsic parallelism of their architectures and environments. Unfortunately, typ...
239
click to vote
POPL
2006
ACM
16 years 3 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
110
click to vote
ICFP
2002
ACM
16 years 2 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
116
click to vote
ICFP
2004
ACM
16 years 2 months ago
2004
ACM
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...