Results 41 to 50 of about 13,143,476 (301)

Explicit Substitutions for Contextual Type Theory [PDF]

Electronic Proceedings in Theoretical Computer Science, 2010
In this paper, we present an explicit substitution calculus which distinguishes between ordinary bound variables and meta-variables. Its typing discipline is derived from contextual modal type theory.
Andreas Abel, Brigitte Pientka
doaj   +1 more source

A Reasonably Exceptional Type Theory [PDF]

, 2019
International audienceTraditional approaches to compensate for the lack of exceptions in type theories for proof assistants have severe drawbacks from both a programming and a reasoning perspective.Pédrot and Tabareau recently extended the Calculus of ...
Pédrot, Pierre-Marie, Tanter, Éric, Tabareau, Nicolas, Fehrmann, Hans, Jacob   +3 more
core   +1 more source

A Formal Verification Approach for Linux Kernel Designing

Technologies
Although the Linux kernel is widely used, its complexity makes errors common and potentially serious. Traditional formal verification methods often have high overhead and rely heavily on manual coding.
Zi Wang, Yuqing Lan, Xinlei He, Jianghua Lv   +3 more
doaj   +1 more source

Web-Based Questionnaires for Type Theory Course [PDF]

Acta Electrotechnica et Informatica, 2017
This paper describes our effort on the usage of modern information and communication technologies as well as innovation process in the field of teaching.
Daniel MIHÁLYI, Monika PENIAŠKOVÁ, Ján PERHÁČ, Jurij MIHELIČ   +3 more
doaj   +1 more source

Type theory and concurrency [PDF]

International Journal of Parallel Programming, 1988
This very readable article discusses the use of an automated reasoning tool (Nuprl) in the context of concurrent programming, in particular Milner's CCS. To this end a denotational model of concurrency based on Aczel's non-well-founded sets is developed (which, by the way, resembles also de Bakker \& Zucker's processes approach, and) which serves as ...
Rance Cleaveland, Prakash Panangaden
openaire   +2 more sources

HYBRID PARTIAL TYPE THEORY

, 2023
In this article we define a logical system called Hybrid Partial Type Theory (HPTT). The system is obtained by combining William Farmer's partial type theory with a strong form of hybrid logic.
Manzano Arjona, María, Martins, Manuel Antonio, Aranda, Víctor, PATRICK BLACKBURN, Martins, Manuel, Huertas, Antonia, MARÍA MANZANO, Aranda Utrero, Víctor, Blackburn, Patrick, ANTONIA HUERTAS, MANUEL MARTINS, VÍCTOR ARANDA, Manzano, María, Blackburn, Patrick; id_orcid   +13 more
core   +1 more source

Weak omega-categories from intensional type theory [PDF]

Logical Methods in Computer Science, 2010
We show that for any type in Martin-L\"of Intensional Type Theory, the terms of that type and its higher identity types form a weak omega-category in the sense of Leinster.
Peter LeFanu Lumsdaine
doaj   +1 more source

Constructive Dynamic Syntax

Languages
This paper explores the integration of constructive type theory in the tradition of Martin Löf into Dynamic Syntax.
Stergios Chatzikyriakidis
doaj   +1 more source

The Taming of the Rew: A Type Theory with Computational Assumptions [PDF]

, 2021
International audienceDependently typed programming languages and proof assistants such as Agda and Coq rely on computation to automatically simplify expressions during type checking.
Winterhalter, Théo, Cockx, Jesper, Tabareau, Nicolas (author), Tabareau, Nicolas, Cockx, J.G.H. (author), Winterhalter, Théo (author), Théo Winterhalter, Jesper Cockx, Nicolas Tabareau   +8 more
core   +1 more source

Categorical Type Theory

, 1985
This paper examines the connections between intuitionistic type theory and category theory. A version of type theory is developed in a category theoretic framework by interpreting types as objects and type connectives as constructions in categories ...
Panangaden, Prakash, Schwartzbach, Michael I.   +1 more
core   +5 more sources