5451 search results - page 84 / 1091 » Typed Operational Semantics |
130
click to vote
APLAS
2004
ACM
15 years 8 months ago
2004
ACM
Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronizatio...
143
Voted
JAR
2007
15 years 2 months ago
2007
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
112
Voted
FOIKS
2008
Springer
15 years 4 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
134
Voted
APLAS
2004
ACM
15 years 8 months ago
2004
ACM
Abstract. We give a semantic footing to the fold/build syntax of programming with inductive types, covering shortcut deforestation, based on a universal property. Specifically, we...
129
click to vote
CSL
2000
Springer
15 years 7 months ago
2000
Springer
This paper introduces a typed λ-calculus called λPower , a predicative reformulation of part of Cardelli’s power type system. Power types integrate subtyping into the typing t...