Sciweavers

166 search results - page 4 / 34
» A Parameterised Module System for Constructing Typed Logic P...
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska
TSE
2008
99views more  TSE 2008»
13 years 7 months ago
Modular Information Hiding and Type-Safe Linking for C
This paper presents CMOD, a novel tool that provides a sound module system for C. CMOD works by enforcing a set of four rules that are based on principles of modular reasoning and...
Saurabh Srivastava, Michael Hicks, Jeffrey S. Fost...
ICFP
2004
ACM
14 years 7 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
ICFP
2008
ACM
14 years 7 months ago
Type checking with open type functions
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The...
Tom Schrijvers, Simon L. Peyton Jones, Manuel M. T...
ICFP
2006
ACM
14 years 7 months ago
From structures and functors to modules and units
t programming techniques encourage abstraction and reuse through external linking. Some parts of a program, however, must use concrete, internally specified references, so a pure ...
Scott Owens, Matthew Flatt