Sciweavers

229 search results - page 25 / 46
» Natural Language Proof Explanation
Sort
View
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
14 years 3 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
LICS
2007
IEEE
14 years 1 months ago
Principles of Superdeduction
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
Paul Brauner, Clément Houtmann, Claude Kirc...
CSFW
1997
IEEE
13 years 11 months ago
Eliminating Covert Flows with Minimum Typings
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
Dennis M. Volpano, Geoffrey Smith
FOSSACS
2008
Springer
13 years 8 months ago
Erasure and Polymorphism in Pure Type Systems
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
Nathan Mishra-Linger, Tim Sheard
AAAI
1992
13 years 8 months ago
From Statistics to Beliefs
An intelligent agent uses known facts, including statistical knowledge, to assign degrees of belief to assertions it is uncertain about. We investigate three principled techniques...
Fahiem Bacchus, Adam J. Grove, Daphne Koller, Jose...