Sciweavers

300 search results - page 9 / 60
» Subset Types and Partial Functions
Sort
View
TYPES
2000
Springer
13 years 11 months ago
Executing Higher Order Logic
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
Stefan Berghofer, Tobias Nipkow
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
14 years 7 months ago
Clustering pair-wise dissimilarity data into partially ordered sets
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...
TPHOL
2005
IEEE
14 years 27 days ago
A Design Structure for Higher Order Quotients
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
Peter V. Homeier
AAAI
2007
13 years 9 months ago
Partial Revelation Automated Mechanism Design
In most mechanism design settings, optimal general-purpose mechanisms are not known. Thus the automated design of mechanisms tailored to specific instances of a decision scenario...
Nathanael Hyafil, Craig Boutilier
ICFP
2010
ACM
13 years 8 months ago
Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation
Partial evaluation aims to improve the efficiency of a program by specialising it with respect to some known inputs. In this paper, we show that partial evaluation can be an effec...
Edwin Brady, Kevin Hammond