Sciweavers

207 search results - page 26 / 42
» Elementary Strong Functional Programming
Sort
View
ISNN
2005
Springer
14 years 1 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
AOSD
2007
ACM
13 years 11 months ago
Highly configurable transaction management for embedded systems
Embedded systems are an important field of research and will gain momentum in the near future. Many of these systems require data management functionality. Due to the resource con...
Mario Pukall, Thomas Leich, Martin Kuhlemann, Mark...
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 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
FOSSACS
2008
Springer
13 years 9 months ago
Erasure and Polymorphism in Pure Type Systems
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
Nathan Mishra-Linger, Tim Sheard
IGPL
2008
124views more  IGPL 2008»
13 years 7 months ago
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Igor Carboni Oliveira, Walter Alexandre Carnielli