Sciweavers

292 search results - page 37 / 59
» First-order intensional logic
Sort
View
ISMIS
1994
Springer
15 years 7 months ago
Reasoning About the Safety of Information: From Logical Formalization to Operational Definition
We assume that safety of information stored in a database depends on the reliability of the agents who have performed the insertions in the database. We present a logic S to repres...
Laurence Cholvy, Robert Demolombe, Andrew J. I. Jo...
SCP
2010
96views more  SCP 2010»
15 years 1 months ago
Enforcing structural regularities in software using IntensiVE
The design and implementation of a software system is often governed by a variety of coding conventions, design patterns, architectural guidelines, design rules, and other so-call...
Johan Brichau, Andy Kellens, Sergio Castro, Theo D...
96
Voted
COLING
1996
15 years 4 months ago
An Education and Research Tool for Computational Semantics
This paper describes an interactive graphical environment for computational semantics. The system provides a teaching tool, a stand alone extendible grapher, and a library of algo...
Karsten Konrad, Holger Maier, David Milward, Manfr...
104
Voted
CORR
2011
Springer
156views Education» more  CORR 2011»
14 years 10 months ago
Extensional Collapse Situations I: non-termination and unrecoverable errors
Abstract. We consider a simple model of higher order, functional computations over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable e...
Antonio Bucciarelli
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 10 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