360 search results - page 37 / 72 » Dependently Typed Programming in Agda |
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
We present a closed dependent type theory whose inductive types are given not by a scheme for generative declarations, but by encoding in a universe. Each inductive datatype arise...
ML
2006
ACM
14 years 1 months ago
2006
ACM
We present an extension to Standard ML, called SMLSC, to support separate compilation. The system gives meaning to individual program fragments, called units. Units may depend on ...
POPL
1990
ACM
13 years 11 months ago
1990
ACM
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
CCS
2010
ACM
13 years 5 months ago
2010
ACM
Given a single program (i.e., bit string), one may assume that the program's behaviors can be determined by first identifying the native runtime architecture and then executi...
POPL
1996
ACM
13 years 11 months ago
1996
ACM
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...