1194 search results - page 74 / 239 » A Calculus for Predicative Programming |
102
click to vote
ESOP
2012
Springer
13 years 9 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
207
click to vote
POPL
2002
ACM
16 years 2 months ago
2002
ACM
Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distribu...
111
click to vote
APLAS
2009
ACM
15 years 8 months ago
2009
ACM
We define a higher-order process calculus with algebraic operations such as encryption and decryption, and develop a bisimulation proof method for behavioral equivalence in this c...
105
click to vote
PPDP
2005
Springer
15 years 7 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
131
click to vote
CTCS
1987
Springer
15 years 5 months ago
1987
Springer
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categoric...