Sciweavers

894 search results - page 57 / 179
» Typed Contracts for Functional Programming
Sort
View
ESOP
2006
Springer
14 years 11 days ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed
TLDI
2003
ACM
121views Formal Methods» more  TLDI 2003»
14 years 1 months ago
Types for atomicity
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic interactions between threads. Previous work has addresse...
Cormac Flanagan, Shaz Qadeer
PPDP
2010
Springer
13 years 7 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch
AFP
2004
Springer
128views Formal Methods» more  AFP 2004»
14 years 2 months ago
GEC: A Toolkit for Generic Rapid Prototyping of Type Safe Interactive Applications
Abstract. Programming GUIs with conventional GUI APIs is notoriously tedious. In these notes we present the GEC toolkit in which the programmer can create user interfaces without a...
Peter Achten, Marko C. J. D. van Eekelen, Rinus Pl...
POPL
2003
ACM
14 years 9 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...