Sciweavers

215 search results - page 26 / 43
» Verifying haskell programs using constructive type theory
Sort
View
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
14 years 2 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
AOSD
2007
ACM
14 years 1 months ago
Tribe: a simple virtual class calculus
Beginning with BETA, a range of programming language mechanisms such as virtual classes (class-valued attributes of objects) have been developed to allow inheritance in the presen...
Dave Clarke, Sophia Drossopoulou, James Noble, Tob...
POPL
2012
ACM
12 years 4 months ago
A type system for borrowing permissions
In object-oriented programming, unique permissions to object references are useful for checking correctness properties such as consistency of typestate and noninterference of conc...
Karl Naden, Robert Bocchino, Jonathan Aldrich, Kev...
SAC
2010
ACM
14 years 3 months ago
Implementing software product lines using traits
A software product line (SPL) is a set of software systems with well-defined commonalities and variabilities that are developed by managed reuse of common artifacts. In this pape...
Lorenzo Bettini, Ferruccio Damiani, Ina Schaefer
PLPV
2010
ACM
14 years 5 months ago
Free theorems for functional logic programs
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
Jan Christiansen, Daniel Seidel, Janis Voigtlä...