Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Aczel, Peter - Departments of Mathematics & Computer Science, University of Manchester
4 Computability In this section we leave the theme of a hierarchy of languages and their corresponding au
Notes on Simply Typed Lambda Calculus \Lambda Ralph Loader y
The Implementation and Power of Computer Languages (The `Power' Part of the Course)
2 Contextfree Grammars and Pushdown Automata As we have seen in Exercise 15, regular languages are not even su#cient to cover wellbalanced
3 Turing Machines We once again wish to generalize the languages we can analyse. Rather than starting on
A direct constructive treatment of the Fundamental Theorem of Galois Theory
Separation Properties in Constructive Topology
THE GENERALISED TYPE-THEORETIC INTEPRETATION OF CONSTRUCTIVE SET THEORY
Notes on the simply typed lambda Peter Aczel
Collection Principles in Dependent Type Theory ?
Notes on Constructive Set Theory Peter Aczel
On the T1 Axiom and Other Separation Properties in Constructive Point-free and
A constructive version of the Lusin Separation Peter Aczel
The Relation Reflection Scheme Peter Aczel
Simple overloading for type theories Peter Aczel
Equalisers of frames in constructive set theory Peter Aczel petera@cs:man:ac:uk
On relating type theories and set theories \Lambda Peter Aczel
Constructive Type Theory Notes for Marktoberdorf 1997
Galois: A Theory Development Project \Lambda Peter Aczel
Local Constructive Set Theory and Inductive Definitions
Aspects of General Topology Constructive Set Theory
The Implementation and Power of Computer Languages (The `Power' Part of the Course)
3 Turing Machines We once again wish to generalize the languages we can analyse. Rather than starting on
Lectures on Semantics: The initial algebra and final coalgebra
A Semantic Universe for the study of Fairness VERY ROUGH AND INCOMPLETE DRAFT
4 Computability In this section we leave the theme of a hierarchy of languages and their corresponding au-
2 Context-free Grammars and Pushdown Automata As we have seen in Exercise 15, regular languages are not even sufficient to cover well-balanced
