Sciweavers

1631 search results - page 6 / 327
» Observing Functional Logic Computations
Sort
View
ICFP
2005
ACM
14 years 9 months ago
A logical analysis of aliasing in imperative higher-order functions
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
Martin Berger, Kohei Honda, Nobuko Yoshida
JUCS
2006
131views more  JUCS 2006»
13 years 9 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
ICML
2004
IEEE
14 years 10 months ago
Relational sequential inference with reliable observations
We present a trainable sequential-inference technique for processes with large state and observation spaces and relational structure. Our method assumes "reliable observation...
Alan Fern, Robert Givan
MFCS
2009
Springer
14 years 4 months ago
Size and Energy of Threshold Circuits Computing Mod Functions
Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n → {0, 1}, where n ≥ 1 and m ≥ 2. Then C outputs “0” if the number of “1”s in an input ...
Kei Uchizawa, Takao Nishizeki, Eiji Takimoto

Book
397views
15 years 8 months ago
Computational Semantics with Functional Programming
"This book on applications of logic in the semantic analysis of language pays the reader the compliment of not assuming anything about what he or she knows (in particular, no...
Jan van Eijck, Christina Unger