Sciweavers

102 search results - page 2 / 21
» Syntactic Logical Relations for Polymorphic and Recursive Ty...
Sort
View
ENTCS
2006
153views more  ENTCS 2006»
13 years 7 months ago
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
Lars Birkedal, Rasmus Ejlers Møgelberg, Ras...
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
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 29 days 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...
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,...
LICS
2006
IEEE
14 years 1 months ago
On Typability for Rank-2 Intersection Types with Polymorphic Recursion
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
Tachio Terauchi, Alex Aiken