Sciweavers

894 search results - page 55 / 179
» Typed Contracts for Functional Programming
Sort
View
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
14 years 2 months ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman

Lab
597views
15 years 8 months ago
Programming Languages Team (PLT)
PLT develops foundations for building reliable, high-performance software. Foundations include practices, languages, semantics, implementation techniques and type systems. To dem...
ICAIL
2007
ACM
14 years 17 days ago
Essential deduplication functions for transactional databases in law firms
As massive document repositories and knowledge management systems continue to expand, in proprietary environments as well as on the Web, the need for duplicate detection becomes i...
Jack G. Conrad, Edward L. Raymond
ICFP
2006
ACM
14 years 8 months ago
OCaml + XDuce
This paper presents the core type system and type inference algorithm of OCamlDuce, a merger between OCaml and XDuce. The challenge was to combine two type checkers of very differ...
Alain Frisch
TLCA
2007
Springer
14 years 2 months ago
Initial Algebra Semantics Is Enough!
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
Patricia Johann, Neil Ghani