Sciweavers

66 search results - page 8 / 14
» Recursive Functions with Higher Order Domains
Sort
View
CORR
2007
Springer
98views Education» more  CORR 2007»
14 years 9 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
AFP
2008
Springer
249views Formal Methods» more  AFP 2008»
15 years 3 months ago
An iTask Case Study: A Conference Management System
Workflow systems are automated systems in which tasks are coordinated by assigning them to either humans or computers. Contemporary workflow systems are static and not very flex...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
MFCS
1993
Springer
15 years 1 months ago
Real Number Computability and Domain Theory
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...
Pietro Di Gianantonio
LISP
2007
124views more  LISP 2007»
14 years 9 months ago
A new generic scheme for functional logic programming with constraints
In this paper we propose a new generic scheme CFLP(D ), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given co...
Francisco Javier López-Fraguas, Mario Rodr&...
ICCV
2011
IEEE
13 years 9 months ago
Generalized Ordering Constraints for Multilabel Optimization
We propose a novel framework for imposing label ordering constraints in multilabel optimization. In particular, label jumps can be penalized differently depending on the jump dire...
Evgeny Strekalovskiy, Daniel Cremers