Now showing items 1-2 of 2
A Framework for Defining Logics
(ASSOC COMPUTING MACHINERY, NEW YORK, 1993)
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed λ-calculus with dependent types. Syntax is treated ...
Uncountable Limits and the Lambda Calculus
(Publishing Association Nordic Journal of Computing, 1995)
In this paper we address the problem of solving recursive domain equations using uncountable limits of domains. These arise for instance, when dealing with the omega_1-continuous function-space constructor and are used ...