Sciweavers

230 search results - page 12 / 46
» Automation for Dependently Typed Functional Programming
Sort
View
LICS
2010
IEEE
13 years 6 months ago
Equality Is Typable in Semi-full Pure Type Systems
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
Vincent Siles, Hugo Herbelin
ICFP
2010
ACM
13 years 8 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
FUIN
2006
85views more  FUIN 2006»
13 years 7 months ago
Implementing Typeful Program Transformations
The notion of program transformation is ubiquitous in programming language studies on interpreters, compilers, partial evaluators, etc. In order to implement a program transformat...
Chiyan Chen, Rui Shi, Hongwei Xi
APLAS
2004
ACM
14 years 1 months ago
PType System: A Featherweight Parallelizability Detector
Parallel programming is becoming an important cornerstone of general computing. In addition, type systems have significant impact on program analysis. In this paper, we demonstrat...
Dana N. Xu, Siau-Cheng Khoo, Zhenjiang Hu
ICFP
2006
ACM
14 years 7 months ago
Polymorphism and separation in hoare type theory
In previous work, we proposed a Hoare Type Theory (HTT) which combines effectful higher-order functions, dependent types and Hoare Logic specifications into a unified framework. H...
Aleksandar Nanevski, Greg Morrisett, Lars Birkedal