Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[КНИГА][B] Categories, Types and Structures.
A Asperti, G Longo - 1991 - ens.hal.science
Categories, Types and Structures. Page 1 HAL Id: hal-03316030 https://ens.hal.science/hal-03316030
Submitted on 10 Aug 2021 HAL is a multi-disciplinary open access archive for the deposit and …
Submitted on 10 Aug 2021 HAL is a multi-disciplinary open access archive for the deposit and …
Realizability toposes and language semantics
JR Longley - 1995 - era.ed.ac.uk
Realizability toposes are" models of constructive set theory" based on abstract notions of
computability. They arose originally in the study of mathematical logic, but since then various …
computability. They arose originally in the study of mathematical logic, but since then various …
[PDF][PDF] A small complete category
JME Hyland - Annals of pure and applied logic, 1988 - researchgate.net
This paper is concerned with a remarkable fact. The effective topos contains a small
complete subcategory, essentially the familiar category of partial equivalence realtions. This …
complete subcategory, essentially the familiar category of partial equivalence realtions. This …
First steps in synthetic domain theory
JME Hyland - Category Theory: Proceedings of the International …, 2006 - Springer
Domain theory is the study of various concrete categories C typically of (directed) complete
partial orders in which constructions fundamental to the analysis of computing can be …
partial orders in which constructions fundamental to the analysis of computing can be …
Constructive natural deduction and its 'ω-set'interpretation
G Longo, E Moggi - Mathematical Structures in Computer Science, 1991 - cambridge.org
Various Theories of Types are introduced, by stressing the analogy 'propositions-as-types':
from propositional to higher order types (and Logic). In accordance with this, proofs are …
from propositional to higher order types (and Logic). In accordance with this, proofs are …
Polymorphism is set theoretic, constructively
AM Pitts - Category Theory and Computer Science: Edinburgh …, 2005 - Springer
The title of this paper ought really to be" Polymorphism can be set theoretic, constructively",
but the obvious reference to Reynolds* paper" Polymorphism is not set theoretic"[R2] was …
but the obvious reference to Reynolds* paper" Polymorphism is not set theoretic"[R2] was …
Some free constructions in realizability and proof theory
A Carboni - Journal of pure and applied algebra, 1995 - Elsevier
Some old and new constructions of free categories with good properties (regularity,
exactness, etc.) are investigated, consistently showing their role in proof theory and in …
exactness, etc.) are investigated, consistently showing their role in proof theory and in …
Elementary quotient completion
We extend the notion of exact completion on a weakly lex category to elementary doctrines.
We show how any such doctrine admits an elementary quotient completion, which freely …
We show how any such doctrine admits an elementary quotient completion, which freely …
The theory of constructions: Categorical semantics and topos-theoretic models
A syntactically rich version of the Coquand-Huet theory of constructions is described as a
theory of dependent types involving expressions at three different levels (Terms, Types and …
theory of dependent types involving expressions at three different levels (Terms, Types and …
Equilogical spaces
It is well known that one can build models of full higher-order dependent-type theory (also
called the calculus of constructions) using partial equivalence relations (PERs) and …
called the calculus of constructions) using partial equivalence relations (PERs) and …