Sciweavers

29 search results - page 2 / 6
» A Nominal Theory of Objects with Dependent Types
Sort
View
CADE
1998
Springer
13 years 9 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary
ENTCS
2008
92views more  ENTCS 2008»
13 years 5 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
EOR
2002
96views more  EOR 2002»
13 years 5 months ago
Multicriteria classification and sorting methods: A literature review
The assignment of alternatives (observations/objects) into predefined homogenous groups is a problem of major practical and research interest. This type of problem is referred to ...
Constantin Zopounidis, Michael Doumpos
KR
2004
Springer
13 years 10 months ago
How to Interweave Knowledge about Object Structure and Concepts
This article presents a general framework for integrating reasoning about object structure and concept taxonomies. The structural relations in the domain of objects discussed are ...
Carola Eschenbach
ICFP
2002
ACM
14 years 5 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski