Sciweavers

1321 search results - page 66 / 265
» Subtyping in Logical Form
Sort
View
CADE
2010
Springer
15 years 29 days ago
Multi-Prover Verification of Floating-Point Programs
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...
Ali Ayad, Claude Marché
ENTCS
2007
107views more  ENTCS 2007»
14 years 11 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
JAR
2002
77views more  JAR 2002»
14 years 11 months ago
Proof Reflection in Coq
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn indices for variable binding. The main judgement we model is of the form d [:] , ...
Dimitri Hendriks
LOGCOM
2002
85views more  LOGCOM 2002»
14 years 11 months ago
Fibring Labelled Deduction Systems
We give a categorial characterization of how labelled deduction systems for logics with a propositional basis behave under unconstrained fibring and under fibring that is constrai...
João Rasga, Amílcar Sernadas, Cristi...
POPL
2005
ACM
16 years 5 days ago
Parametric polymorphism for XML
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
Haruo Hosoya, Alain Frisch, Giuseppe Castagna