57 search results - page 2 / 12 » Automating Side Conditions in Formalized Partial Functions |
KR
2004
Springer
13 years 10 months ago
2004
Springer
Causation is defined recursively: event e is the cause of condition φ in context c iff e is the only sufficient cause of φ in c, and removing e from c either removes φ from c...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The problem of joint source-channel coding in transmitting independent sources over interference channels with correlated receiver side information is studied. When each receiver ...
LOPSTR
1992
Springer
13 years 9 months ago
1992
Springer
We present a self-applicable partial evaluator for a large subset of full Prolog. The partial evaluator, called Logimix, is the result of applying our experience from partial eval...
LICS
1996
IEEE
13 years 9 months ago
1996
IEEE
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application,we show that the pca of str...
TPHOL
2008
IEEE
13 years 11 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...