643 search results - page 71 / 129 » Semantic Determinism and Functional Logic Program Properties |
158
click to vote
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
155
click to vote
APLAS
2006
ACM
15 years 11 months ago
2006
ACM
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
148
click to vote
SIAMCOMP
2008
15 years 5 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
264
click to vote
POPL
2004
ACM
16 years 5 months ago
2004
ACM
In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantif...
255
click to vote
POPL
2006
ACM
16 years 5 months ago
2006
ACM
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...