Sciweavers

6740 search results - page 1147 / 1348
» Using Classification as a Programming Language
Sort
View
IJCAI
1993
15 years 6 months ago
Notes on Formalizing Context
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c, p). It asserts that the proposition p is true in the context c. The most important f...
John McCarthy
LFP
1990
102views more  LFP 1990»
15 years 6 months ago
A Semantic Basis for Quest
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...
Luca Cardelli, Giuseppe Longo
CEC
2010
IEEE
15 years 6 months ago
Tree-adjunct grammatical evolution
In this paper we investigate the application of tree-adjunct grammars to grammatical evolution. The standard type of grammar used by grammatical evolution, context-free grammars, p...
Eoin Murphy, Michael O'Neill, Edgar Galván ...
ATAL
2010
Springer
15 years 5 months ago
Time constraints in mixed multi-unit combinatorial auctions
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
Andreas Witzel, Ulle Endriss
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 5 months ago
Liberalizing Dependency
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
Avik Chaudhuri
« Prev « First page 1147 / 1348 Last » Next »