Sciweavers

400 search results - page 44 / 80
» Logical relations for monadic types
Sort
View
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 1 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
ECOWS
2006
Springer
13 years 11 months ago
WSMO-MX: A Logic Programming Based Hybrid Service Matchmaker
In this paper, we present an approach to hybrid semantic web service matching based on both logic programming, and syntactic similarity measurement. The implemented matchmaker, ca...
Frank Kaufer, Matthias Klusch
TREC
2004
13 years 9 months ago
AnswerFinder at TREC 2004
AnswerFinder combines lexical, syntactic, and semantic information in various stages of the question answering process. The candidate sentences are preselected on the basis of (i)...
Diego Mollá, Mary Gardiner
ICALP
2007
Springer
13 years 11 months ago
Affine Systems of Equations and Counting Infinitary Logic
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
Albert Atserias, Andrei A. Bulatov, Anuj Dawar
ICFP
2005
ACM
14 years 7 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...