Sciweavers

4581 search results - page 852 / 917
» Computing Transformation Semigroups
Sort
View
CONCUR
2009
Springer
15 years 6 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
FSTTCS
2009
Springer
15 years 6 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
OOPSLA
2009
Springer
15 years 6 months ago
Reimagining literate programming
In this paper we describe Ginger, a new language with first class support for literate programming. Literate programming refers to a philosophy that argues computer programs shou...
James Dean Palmer, Eddie Hillenbrand
TLCA
2009
Springer
15 years 6 months ago
Parametricity for Haskell with Imprecise Error Semantics
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
Florian Stenger, Janis Voigtländer
SIGGRAPH
2009
ACM
15 years 6 months ago
BiDi screen: a thin, depth-sensing LCD for 3D interaction using light fields
We transform an LCD into a display that supports both 2D multitouch and unencumbered 3D gestures. Our BiDirectional (BiDi) screen, capable of both image capture and display, is in...
Matthew Hirsch, Douglas Lanman, Henry Holtzman, Ra...