Sciweavers

3323 search results - page 456 / 665
» Computational Semantics with Functional Programming
Sort
View
SAS
2010
Springer
134views Formal Methods» more  SAS 2010»
15 years 5 months ago
Strictness Meets Data Flow
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
Tom Schrijvers, Alan Mycroft
ICALP
2009
Springer
16 years 6 months ago
Bounds on the Size of Small Depth Circuits for Approximating Majority
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
Kazuyuki Amano
CALCO
2009
Springer
172views Mathematics» more  CALCO 2009»
16 years 1 months ago
Coalgebraic Components in a Many-Sorted Microcosm
The microcosm principle, advocated by Baez and Dolan and formalized for Lawvere theories lately by three of the authors, has been applied to coalgebras in order to describe composi...
Ichiro Hasuo, Chris Heunen, Bart Jacobs, Ana Sokol...
ICCS
2005
Springer
16 years 2 days ago
A Fuzzy Index Tracking Portfolio Selection Model
The investment strategies can be divided into two classes: passive investment strategies and active investment strategies. An index tracking investment strategy belongs to the clas...
Yong Fang, Shouyang Wang
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
16 years 20 hour ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko