Sciweavers

300 search results - page 13 / 60
» Subset Types and Partial Functions
Sort
View
ECSQARU
2005
Springer
14 years 26 days ago
Multiple Semi-revision in Possibilistic Logic
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a n...
Guilin Qi, Weiru Liu, David A. Bell
APLAS
2006
ACM
14 years 1 months ago
A Bytecode Logic for JML and Types
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
Lennart Beringer, Martin Hofmann
AML
2005
65views more  AML 2005»
13 years 7 months ago
Middle diamond
Under certain cardinal arithmetic assumptions, we prove that for every large enough regular cardinal, for many regular < , many stationary subsets of concentrating on cofinali...
Saharon Shelah
HASKELL
2005
ACM
14 years 27 days ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 7 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour