Sciweavers

1982 search results - page 82 / 397
» Parametricity and dependent types
Sort
View
150
Voted
CSL
2005
Springer
15 years 10 months ago
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
Frédéric Blanqui
122
Voted
TYPES
2004
Springer
15 years 10 months ago
Exploring the Regular Tree Types
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
Peter Morris, Thorsten Altenkirch, Conor McBride
134
Voted
SCP
2008
144views more  SCP 2008»
15 years 4 months ago
Implicit ownership types for memory management
Abstract. The Real-time Specification for Java (RTSJ) introduced a range of language features for explicit memory management. While the RTSJ gives programmers fine control over mem...
Tian Zhao, Jason Baker, James Hunt, James Noble, J...
124
Voted
ENTCS
2000
112views more  ENTCS 2000»
15 years 4 months ago
Typed Multiset Rewriting Specifications of Security Protocols
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
Iliano Cervesato
122
Voted
PLPV
2010
ACM
16 years 1 months ago
Resource typing in Guru
This paper presents a resource typing framework for the Guru d-programming language, in which abstractions for various kinds of program resources can be defined. Implemented exam...
Aaron Stump, Evan Austin