632 search results - page 41 / 127 » Proving Invariants of Functional Programs |
171
Voted
ALC
1997
15 years 1 months ago
1997
A predicative semantics is a mapping of programs to predicates. These predicates characterize sets of acceptable observations. The presence of time in the observations makes the o...
106
click to vote
FSEN
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Component-based programming is about how to create application programs from prefabricated components with new software that provides both glue between the components, an...
101
Voted
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
77
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
94
Voted
FPCA
1995
15 years 4 months ago
1995
We add functional continuations and prompts to a language with an ML-style type system. The operators signi cantly extend and simplify the control operators in SML/NJ, and can be ...