Sciweavers

894 search results - page 47 / 179
» Typed Contracts for Functional Programming
Sort
View
POPL
1997
ACM
14 years 26 days ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
ENTCS
2007
109views more  ENTCS 2007»
13 years 8 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
ML
2006
ACM
14 years 2 months ago
Ocsigen: typing web interaction with objective Caml
Ocsigen is a framework for programming highly dynamic web sites in Objective Caml. It allows to program sites as Ocaml applications and introduces new concepts to take into accoun...
Vincent Balat
ICFP
2006
ACM
14 years 8 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
IJCAI
1993
13 years 10 months ago
A Language for Implementing Arbitrary Logics
SEQUEL is a new-generation functional programming language, which allows the specification of types in a notation based on the sequent calculus. The sequent calculus notation suff...
Mark Tarver