894 search results - page 63 / 179 » Typed Contracts for Functional Programming |
PLDI
2010
ACM
14 years 6 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
POPL
1999
ACM
14 years 1 months ago
1999
ACM
An ambient is a named cluster of processes and subambients, which moves as a group. We describe type systems able to guarantee that certain ambients will remain immobile, and that ...
ICFP
2007
ACM
14 years 8 months ago
2007
ACM
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
AAIP
2009
13 years 6 months ago
2009
Given an appropriate domain specific language (DSL), it is possible to describe the relationship between Haskell data types and many generic functions, typically type-class instan...
CMSB
2006
Springer
14 years 13 days ago
2006
Springer
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...