Sciweavers

640 search results - page 26 / 128
» Logical types for untyped languages
Sort
View
STACS
2009
Springer
14 years 2 months ago
Weak MSO with the Unbounding Quantifier
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ω-regular languages. The class has two equivalent desc...
Mikolaj Bojanczyk
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...
SAC
2006
ACM
14 years 1 months ago
Union types for object-oriented programming
We propose union types for statically typed class-based objectoriented languages as a means to enhance the flexibility of subtyping. As its name suggests, a union type can be con...
Atsushi Igarashi, Hideshi Nagira
FOSSACS
2007
Springer
14 years 1 months ago
Relational Parametricity and Separation Logic
Abstract. Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new inte...
Lars Birkedal, Hongseok Yang
PLPV
2010
ACM
14 years 4 months ago
Resource typing in Guru
This paper presents a resource typing framework for the Guru d-programming language, in which abstractions for various kinds of program resources can be defined. Implemented exam...
Aaron Stump, Evan Austin