Sciweavers

2335 search results - page 129 / 467
» Type Checking Type Classes
Sort
View
FLOPS
2010
Springer
15 years 9 months ago
Code Generation via Higher-Order Rewrite Systems
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
Florian Haftmann, Tobias Nipkow
TPHOL
1995
IEEE
15 years 5 months ago
HOLCF: Higher Order Logic of Computable Functions
This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which o e...
Franz Regensburger
EACL
1993
ACL Anthology
15 years 3 months ago
New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound de...
Peter Staudacher
IJCAI
2007
15 years 3 months ago
Mechanism Design with Partial Revelation
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
Nathanael Hyafil, Craig Boutilier
JUCS
2010
115views more  JUCS 2010»
14 years 9 months ago
Redundant Relations in Relational Databases: A Model Theoretic Perspective
: We initiate in this work the study of a sort of redundancy problem revealed by what we call redundant relations. Roughly, we define a redundant relation in a database instance (d...
Flavio Antonio Ferrarotti, Alejandra Lorena Paolet...