Sciweavers

743 search results - page 90 / 149
» A Calculus of Gamma Programs
Sort
View
ENTCS
2008
75views more  ENTCS 2008»
13 years 7 months ago
Focusing the Inverse Method for LF: A Preliminary Report
In this paper, we describe a proof-theoretic foundation for bottom-up logic programming based on uniform proofs in the setting of the logical framework LF. We present a forward un...
Brigitte Pientka, Xi Li, Florent Pompigne
ENTCS
2006
120views more  ENTCS 2006»
13 years 7 months ago
SCHOOL: a Small Chorded Object-Oriented Language
Chords are a declarative synchronisation construct based on the Join-Calculus, available in the programming language C. To our knowledge, chords have no formal model in an object-...
Sophia Drossopoulou, Alexis Petrounias, Alex Buckl...
ENTCS
2002
91views more  ENTCS 2002»
13 years 7 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»
13 years 2 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
GPCE
2007
Springer
14 years 2 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...