Sciweavers

237 search results - page 32 / 48
» Coercions in a polymorphic type system
Sort
View
HASKELL
2005
ACM
14 years 2 months ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...
SCP
2011
255views Communications» more  SCP 2011»
13 years 3 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
AOSD
2007
ACM
14 years 23 days 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
1996
ACM
14 years 27 days ago
Using Parameterized Signatures to Express Modular Structure
Module systems are a powerful, practical tool for managing the complexity of large software systems. Previous attempts to formulate a type-theoretic foundation for modular program...
Mark P. Jones
SPE
2002
111views more  SPE 2002»
13 years 8 months ago
FC++: Functional tools for object-oriented tasks
FC++ is a library for programming functionally in C++. Compared to other C++ functional programming libraries, FC++ is distinguished by its powerful type system which allows manip...
Yannis Smaragdakis, Brian McNamara