Sciweavers

894 search results - page 60 / 179
» Typed Contracts for Functional Programming
Sort
View
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 8 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
ENTCS
2002
121views more  ENTCS 2002»
13 years 8 months ago
Regular Expression Types for Strings in a Text Processing Language
d Abstract) Naoshi Tabuchi Eijiro Sumii Akinori Yonezawa 1 Department of Computer Science, Graduate School of Information Science and Technology, University of Tokyo We present re...
Naoshi Tabuchi, Eijiro Sumii, Akinori Yonezawa
CORR
2008
Springer
93views Education» more  CORR 2008»
13 years 8 months ago
A computer verified, monadic, functional implementation of the integral
We provide a computer verified exact monadic functional implementation of the Riemann integral in type theory. Together with previous work by O'Connor, this may be seen as the...
Russell O'Connor, Bas Spitters
ACL2
2006
ACM
14 years 2 months ago
Soundness of the simply typed lambda calculus in ACL2
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
Sol Swords, William R. Cook
DLS
2005
148views Languages» more  DLS 2005»
13 years 10 months ago
Compile-time meta-programming in a dynamically typed OO language
Compile-time meta-programming allows programs to be constructed by the user at compile-time. Although LISP derived languages have long had such facilities, few modern languages ar...
Laurence Tratt