Sciweavers

52 search results - page 3 / 11
» Deep Inference and Its Normal Form of Derivations
Sort
View
ENTCS
2010
133views more  ENTCS 2010»
13 years 26 days ago
Inference of Session Types From Control Flow
This is a study of a technique for deriving the session type of a program written in a statically typed imperative language from its control flow. We impose on our unlabelled sess...
Peter Collingbourne, Paul H. J. Kelly
IJAR
2006
98views more  IJAR 2006»
13 years 6 months ago
Inference in hybrid Bayesian networks with mixtures of truncated exponentials
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for solving hybrid Bayesian networks. Any probability density function can be approximated...
Barry R. Cobb, Prakash P. Shenoy
MCMASTER
1993
13 years 10 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
LREC
2008
175views Education» more  LREC 2008»
13 years 7 months ago
Arabic WordNet: Semi-automatic Extensions using Bayesian Inference
This presentation focuses on the semi-automatic extension of Arabic WordNet (AWN) using lexical and morphological rules and applying Bayesian inference. We briefly report on the c...
Horacio Rodríguez, David Farwell, Javi Ferr...
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
13 years 10 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein