Sciweavers

3116 search results - page 71 / 624
» Positively dependent types
Sort
View
FROCOS
2005
Springer
15 years 5 months ago
ATS: A Language That Combines Programming with Theorem Proving
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...
Sa Cui, Kevin Donnelly, Hongwei Xi
IFIP
2004
Springer
15 years 5 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
IWPC
2000
IEEE
15 years 4 months ago
Evaluating the Accessor Classification Approach to Detect Abstract Data Types
ng the Accessor Classification Approach to Detect Abstract Data Types icle presents an approach to identify abstract data types (ADTs) in source code. For each structured type de...
Jean-Francois Girard, Martin Würthner
CRYPTO
2006
Springer
149views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
CSL
2008
Springer
15 years 1 months ago
Type-Based Termination with Sized Products
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
Gilles Barthe, Benjamin Grégoire, Colin Rib...