Sciweavers

397 search results - page 77 / 80
» The lambda calculus is algebraic
Sort
View
ISCI
2008
93views more  ISCI 2008»
14 years 9 months ago
Safety, domain independence and translation of complex value database queries
This paper considers the theory of database queries on the complex value data model with external functions. Motivated by concerns regarding query evaluation, we first identify re...
Hong-Cheu Liu, Jeffrey Xu Yu, Weifa Liang
JLP
2006
81views more  JLP 2006»
14 years 9 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
TCS
2008
14 years 9 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
ENTCS
2000
59views more  ENTCS 2000»
14 years 9 months ago
Building continuous webbed models for system F
We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the mod...
Stefano Berardi, Chantal Berline
JAR
2010
98views more  JAR 2010»
14 years 4 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall