Sciweavers

1194 search results - page 146 / 239
» A Calculus for Predicative Programming
Sort
View
ENTCS
2002
91views more  ENTCS 2002»
14 years 11 months ago
Subtyping in Logical Form
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
Ugo de'Liguoro
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 6 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
RTA
2005
Springer
15 years 5 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
APAL
2007
78views more  APAL 2007»
15 years 5 hour ago
Partial Horn logic and cartesian categories
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...
Erik Palmgren, Steven J. Vickers
GPCE
2007
Springer
15 years 6 months ago
Oz/K: a kernel language for component-based open programming
Programming in an open environment remains challenging because it requires combining modularity, security, concurrency, distribution, and dynamicity. In this paper, we propose an ...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...