Sciweavers

18429 search results - page 137 / 3686
» Typing dynamic typing
Sort
View
143
Voted
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 12 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
145
Voted
CPP
2011
99views more  CPP 2011»
14 years 4 months ago
Proof-Carrying Code in a Session-Typed Process Calculus
Abstract. Dependent session types allow us to describe not only properties of the I/O behavior of processes but also of the exchanged data. In this paper we show how to exploit dep...
Frank Pfenning, Luís Caires, Bernardo Tonin...

Book
314views
17 years 3 months ago
Programming in Martin-Löf's Type Theory
"This book describes different type theories (theories of types, polymorphic and monomorphic sets, and subsets) from a computing science perspective. It is intended for resear...
Bengt Nordström, Kent Petersson, Jan M. Smith
CADE
2003
Springer
16 years 5 months ago
Subset Types and Partial Functions
A classical higher-order logic PFsub of partial functions is defined. The logic extends a version of Farmer's logic PF by enriching the type system of the logic with subset ty...
Aaron Stump
112
Voted
PADL
2010
Springer
16 years 1 months ago
Explicitly Typed Exceptions for Haskell
Abstract. We describe a monad for checked, explicitly typed exceptions, which provides as a simple Haskell library what for other languages is a native feature. Multi parameter typ...
José Iborra