Sciweavers

400 search results - page 19 / 80
» Logical relations for monadic types
Sort
View
ICFP
2009
ACM
14 years 8 months ago
Purely functional lazy non-deterministic programming
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
Sebastian Fischer, Oleg Kiselyov, Chung-chieh Shan
CADE
2006
Springer
14 years 8 months ago
On the Strength of Proof-Irrelevant Type Theories
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
Benjamin Werner
EUSFLAT
2009
212views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
An Interval Type-2 Fuzzy Distribution Network
Abstract-- Planning resources for a supply chain is a major factor determining its success or failure. In this paper we introduce an Interval Type-2 Fuzzy Logic model of a distribu...
Simon Miller, Viara Popova, Robert John, Mario A. ...
ACTA
1998
64views more  ACTA 1998»
13 years 7 months ago
Converting Untyped Formulas to Typed Ones
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
Jan Van den Bussche, Luca Cabibbo
ML
2006
ACM
122views Machine Learning» more  ML 2006»
13 years 7 months ago
PRL: A probabilistic relational language
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...
Lise Getoor, John Grant