Sciweavers

2880 search results - page 37 / 576
» Types are calling conventions
Sort
View
CADE
2006
Springer
16 years 5 months ago
Combining Type Theory and Untyped Set Theory
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
Chad E. Brown
CSR
2010
Springer
15 years 8 months ago
Sofic and Almost of Finite Type Tree-Shifts
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
Nathalie Aubrun, Marie-Pierre Béal
127
Voted
JFP
2006
103views more  JFP 2006»
15 years 4 months ago
Phantom types and subtyping
We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to mo...
Matthew Fluet, Riccardo Pucella
CIE
2007
Springer
15 years 11 months ago
Quotients over Minimal Type Theory
Abstract. We consider an extensional version, called qmTT, of the intensional Minimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proof-irrelevanc...
Maria Emilia Maietti
132
Voted
PPDP
2005
Springer
15 years 10 months ago
Isolation-only transactions by typing and versioning
In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks). Tasks allow isolation to be declared instead of having to be ...
Pawel T. Wojciechowski