Sciweavers

JAR
2010
122views more  JAR 2010»
12 years 11 months ago
Partial and Nested Recursive Function Definitions in Higher-order Logic
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
Alexander Krauss
COMBINATORICS
2004
97views more  COMBINATORICS 2004»
13 years 4 months ago
Dominance Order and Graphical Partitions
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to ...
Axel Kohnert
TSP
2008
139views more  TSP 2008»
13 years 4 months ago
Bayesian Filtering With Random Finite Set Observations
This paper presents a novel and mathematically rigorous Bayes recursion for tracking a target that generates multiple measurements with state dependent sensor field of view and clu...
Ba-Tuong Vo, Ba-Ngu Vo, Antonio Cantoni
ML
2008
ACM
13 years 4 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
ENTCS
2006
98views more  ENTCS 2006»
13 years 4 months ago
A Generic Process Algebra
The three classical process algebras CCS, CSP and ACP present several differences in their respective technical machinery. This is due, not only to the difference in their operato...
Jos C. M. Baeten, Mario Bravetti
APLAS
2004
ACM
13 years 10 months ago
A Functional Language for Logarithmic Space
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however eï...
Peter Møller Neergaard

Book
411views
15 years 2 months ago
Concrete Abstractions
"This book has evolved from materials used in an undergraduate course intended for final year undergraduate students whose background includes at least one year's experie...
Max Hailperin, Barbara Kaiser, and Karl Knight