Sciweavers

233 search results - page 23 / 47
» Computational Lambda-Calculus and Monads
Sort
View
STACS
2001
Springer
13 years 12 months ago
A Toolkit for First Order Extensions of Monadic Games
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
David Janin, Jerzy Marcinkowski
PEPM
2009
ACM
14 years 4 months ago
Designing aspects for side-effect localization
Computation performed in many typical aspects involve side effects. In a purely functional setting, adding such aspects using techniques such as monadification will generally lea...
Kung Chen, Jia-Yin Lin, Shu-Chun Weng, Siau-Cheng ...
CALCO
2005
Springer
75views Mathematics» more  CALCO 2005»
14 years 1 months ago
Parametrized Exceptions
Following the paradigm of encapsulation of side effects via monads, the Java execution mechanism has been described by the socalled Java monad, encorporating essentially stateful ...
Dennis Walter, Lutz Schröder, Till Mossakowsk...
STACS
2009
Springer
14 years 2 months ago
Weak MSO with the Unbounding Quantifier
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ω-regular languages. The class has two equivalent desc...
Mikolaj Bojanczyk
BIRTHDAY
2003
Springer
14 years 23 days ago
Colimits for Concurrent Collectors
Abstract. This case study applies techniques of formal program development by specification refinement and composition to the problem of concurrent garbage collection. The speci...
Dusko Pavlovic, Peter Pepper, Douglas R. Smith