921 search results - page 6 / 185 » Expressing Computational Complexity in Constructive Type The... |
APAL
2010
13 years 7 months ago
2010
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTT0 and LTT 0, which we...
JAPLL
2006
13 years 7 months ago
2006
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
CASC
2010
Springer
13 years 6 months ago
2010
Springer
Computer algebra in scientific computation squarely faces the dilemma of natural mathematical expression versus efficiency. While higher-order programming constructs and parametri...
TACS
1994
Springer
13 years 11 months ago
1994
Springer
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...