277 search results - page 19 / 56 » A First-Order Theory of Types and Polymorphism in Logic Prog... |
TACS
1991
Springer
13 years 11 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
SCP
2011
13 years 2 months ago
2011
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...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
TLDI
2010
ACM
14 years 4 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...