Sciweavers

400 search results - page 15 / 80
» Logical relations for monadic types
Sort
View
ICFP
2008
ACM
14 years 7 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
RTA
2005
Springer
14 years 1 months ago
Automata and Logics for Unranked and Unordered Trees
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
Iovka Boneva, Jean-Marc Talbot
HASKELL
2006
ACM
14 years 1 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
ACL
2009
13 years 5 months ago
Jointly Identifying Temporal Relations with Markov Logic
Recent work on temporal relation identification has focused on three types of relations between events: temporal relations between an event and a time expression, between a pair o...
Katsumasa Yoshikawa, Sebastian Riedel, Masayuki As...
ICDT
2001
ACM
189views Database» more  ICDT 2001»
14 years 17 hour ago
A Semi-monad for Semi-structured Data
This document proposes an algebra for XML Query. The algebra has been submitted to the W3C XML Query Working Group. A novel feature of the algebra is the use of regular-expression ...
Mary F. Fernández, Jérôme Sim&...