36 search results - page 6 / 8 » Intersection Type Systems and Explicit Substitutions Calculi |
FOSSACS
2003
Springer
14 years 21 days ago
2003
Springer
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
ICFP
2000
ACM
13 years 12 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
MFCS
2004
Springer
14 years 25 days ago
2004
Springer
We define BACI (Boxed Ambients with Communication Interfaces), an ambient calculus with a flexible communication policy. Traditionally, typed ambient calculi have a fixed commu...
PLDI
2010
ACM
14 years 4 months ago
2010
ACM
A number of programming languages use rich type systems to verify security properties of code. Some of these languages are meant for source programming, but programs written in th...