2272 search results - page 245 / 455 » A Calculus for |
178
click to vote
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
This paper defines a probabilistic barbed congruence which turns out to coincide with observational equivalence in a probabilistic extension of CCS. Based on this coincidence resu...
143
click to vote
TLCA
1993
Springer
15 years 8 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
187
Voted
TLCA
1993
Springer
15 years 8 months ago
1993
Springer
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...
115
click to vote
TACS
1994
Springer
15 years 8 months ago
1994
Springer
We introduce simple object calculi that support method override and object subsumption. We give an untyped calculus, typing rules, and equational rules. We illustrate the expressi...
146
click to vote
POPL
1989
ACM
15 years 8 months ago
1989
ACM
Dynamic typing can be useful in statically typed languages. We extend the simply typed λ-calculus with dynamic typing and elaborate additional features like polymorphism and subty...