1194 search results - page 80 / 239 » A Calculus for Predicative Programming |
143
click to vote
TLCA
2005
Springer
15 years 10 months ago
2005
Springer
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
152
click to vote
LATIN
2010
Springer
15 years 3 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
143
click to vote
JLP
2010
14 years 11 months ago
2010
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
125
click to vote
LOPSTR
2004
Springer
15 years 10 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
143
click to vote
ICLP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concu...