AbstractWe investigate the development of theories of types and computability via realizability.This book is a slight revision of the author's Ph.D. thesis, written at Carnegie Mellon University, Pittsburgh, under the guidance of Prof. Dana S. Scott.This book is available in two formats: pdf and postscript. The pdf version has active hyper-references.May 23, 2000Lars Birkeda
Type theory plays an essential role in computing and information science. It is the native language ...
peer reviewedChurch’s type theory, aka simple type theory, is a formal logical language which includ...
The first of my four lectures on the logical foundations of computer security will establish the ma-...
AbstractWe investigate the development of theories of types and computability via realizability.This...
We investigate the development of theories of types and computability via realizability. In the firs...
The implementation and semantics of dependent type theories can be studied in a syntax-independent w...
Main Goal: One goal of these two lectures is to explain how important ideas and problems from comput...
Introduction Domain Theory, type theory (both in the style of Martin-Lof [40, 41] and in the polymo...
This thesis traces the development ofthe theory of types from its origins in the early twentieth cen...
computability theory : : : : : : : : : : : : : : : : : : : : : : 82 5.5 Building a partial object ty...
Computational type theory provides answers to questions such as: What is a type? What is a natural ...
These notes comprise the lecture Introduction to Type Theory that I gave at the Alpha Lernet Summe...
AbstractWe investigate the development of theories of types and computability via realizability.In t...
AbstractIt is well-known that one can build models of full higher-order dependent type theory (a.k.a...
AbstractThis tutorial aims at giving an account on the realizability models for several constructive...
Type theory plays an essential role in computing and information science. It is the native language ...
peer reviewedChurch’s type theory, aka simple type theory, is a formal logical language which includ...
The first of my four lectures on the logical foundations of computer security will establish the ma-...
AbstractWe investigate the development of theories of types and computability via realizability.This...
We investigate the development of theories of types and computability via realizability. In the firs...
The implementation and semantics of dependent type theories can be studied in a syntax-independent w...
Main Goal: One goal of these two lectures is to explain how important ideas and problems from comput...
Introduction Domain Theory, type theory (both in the style of Martin-Lof [40, 41] and in the polymo...
This thesis traces the development ofthe theory of types from its origins in the early twentieth cen...
computability theory : : : : : : : : : : : : : : : : : : : : : : 82 5.5 Building a partial object ty...
Computational type theory provides answers to questions such as: What is a type? What is a natural ...
These notes comprise the lecture Introduction to Type Theory that I gave at the Alpha Lernet Summe...
AbstractWe investigate the development of theories of types and computability via realizability.In t...
AbstractIt is well-known that one can build models of full higher-order dependent type theory (a.k.a...
AbstractThis tutorial aims at giving an account on the realizability models for several constructive...
Type theory plays an essential role in computing and information science. It is the native language ...
peer reviewedChurch’s type theory, aka simple type theory, is a formal logical language which includ...
The first of my four lectures on the logical foundations of computer security will establish the ma-...
DOI
Add to ORKG