Sciweavers

1458 search results - page 109 / 292
» Monads for incremental computing
Sort
View
119
Voted
TARK
2005
Springer
15 years 8 months ago
First-order classical modal logic: applications in logics of knowledge and probability
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighb...
Horacio L. Arló-Costa, Eric Pacuit
140
Voted
DBPL
1999
Springer
114views Database» more  DBPL 1999»
15 years 7 months ago
Structured Document Transformations Based on XSL
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
Sebastian Maneth, Frank Neven
POPL
1993
ACM
15 years 7 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
CORR
2006
Springer
144views Education» more  CORR 2006»
15 years 3 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil
193
Voted
DLS
2009
179views Languages» more  DLS 2009»
15 years 1 months ago
Directing JavaScript with arrows
JavaScript programmers make extensive use of event-driven programming to help build responsive web applications. However, standard approaches to sequencing events are messy, and o...
Yit Phang Khoo, Michael Hicks, Jeffrey S. Foster, ...