Sciweavers

2272 search results - page 258 / 455
» A Calculus for
Sort
View
CSL
2007
Springer
15 years 10 months ago
Not Enough Points Is Enough
Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as “λ-models”, or as (structures arising fr...
Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzon...
ECOOP
2007
Springer
15 years 10 months ago
Gradual Typing for Objects
Static and dynamic type systems have well-known strengths and weaknesses. In previous work we developed a gradual type system for a functional calculus named λ? →. Gradual typin...
Jeremy G. Siek, Walid Taha
FOSSACS
2007
Springer
15 years 10 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
IFM
2007
Springer
101views Formal Methods» more  IFM 2007»
15 years 10 months ago
Translating FSP into LOTOS and Networks of Automata
Many process calculi have been proposed since Robin Milner and Tony Hoare opened the way more than 25 years ago. Although they are based on the same kernel of operators, most of th...
Gwen Salaün, Jeff Kramer, Frédé...
SAS
2007
Springer
140views Formal Methods» more  SAS 2007»
15 years 10 months ago
Formalised Inductive Reasoning in the Logic of Bunched Implications
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...
James Brotherston