Sciweavers

233 search results - page 44 / 47
» Computational Lambda-Calculus and Monads
Sort
View
TARK
2005
Springer
14 years 28 days 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
DBPL
1999
Springer
114views Database» more  DBPL 1999»
13 years 11 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
13 years 11 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»
13 years 7 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
ENTCS
2002
114views more  ENTCS 2002»
13 years 7 months ago
Adjunction Models For Call-By-Push-Value With Stacks
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...
Paul Blain Levy