Sciweavers

277 search results - page 26 / 56
» A First-Order Theory of Types and Polymorphism in Logic Prog...
Sort
View
POPL
2004
ACM
14 years 8 months ago
Formalization of generics for the .NET common language runtime
We present a formalization of the implementation of generics in the .NET Common Language Runtime (CLR), focusing on two novel aspects of the implementation: mixed specialization a...
Dachuan Yu, Andrew Kennedy, Don Syme
ICFP
2006
ACM
14 years 7 months ago
Simple unification-based type inference for GADTs
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
DOOD
1993
Springer
135views Database» more  DOOD 1993»
13 years 11 months ago
A Deductive and Typed Object-Oriented Language
In this paper we introduce a logical query language extended with object-oriented typing facilities. This language, called DTL (from DataTypeLog), can be seen as an extension of Da...
René Bal, Herman Balsters
ENTCS
2002
148views more  ENTCS 2002»
13 years 7 months ago
A Declarative Debugging System for Lazy Functional Logic Programs
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
Rafael Caballero, Mario Rodríguez-Artalejo
KI
1990
Springer
13 years 11 months ago
The Representation of Program Synthesis in Higher Order Logic
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
Christoph Kreitz