Sciweavers

36 search results - page 4 / 8
» Intersection Type Systems and Explicit Substitutions Calculi
Sort
View
FOSSACS
2003
Springer
14 years 21 days ago
Type Assignment for Intersections and Unions in Call-by-Value Languages
We develop a system of type assignment with intersection types, union types, indexed types, and universal and existential dependent types that is sound in a call-by-value functiona...
Joshua Dunfield, Frank Pfenning
CC
2003
Springer
250views System Software» more  CC 2003»
14 years 21 days ago
Automatic Detection of Uninitialized Variables
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
Thi Viet Nga Nguyen, François Irigoin, Cori...
BIRTHDAY
2004
Springer
14 years 27 days ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
DIM
2007
ACM
13 years 11 months ago
Using reputation to augment explicit authorization
Online social networks are formed when web applications allow users to contribute to an online community. The explosive growth of these social networks taxes the management capaci...
Phillip J. Windley, Devlin Daley, Bryant Cutler, K...
ESOP
2008
Springer
13 years 9 months ago
Practical Programming with Higher-Order Encodings and Dependent Types
Abstract. Higher-order abstract syntax (HOAS) refers to the technique of representing variables of an object-language using variables of a meta-language. The standard first-order a...
Adam Poswolsky, Carsten Schürmann