<--- Back to Details
First PageDocument Content
Software engineering / Software / Type theory / Programming language theory / Proof assistants / Functional languages / Formal methods / Logic in computer science / Formal verification / Dependent type / Agda / Coq
Date: 2015-11-12 17:02:31
Software engineering
Software
Type theory
Programming language theory
Proof assistants
Functional languages
Formal methods
Logic in computer science
Formal verification
Dependent type
Agda
Coq

bイオウウ・ャウL@SP@o」エッ「・イ@RPQU cost@PUUOQU decision sオ「ェ・」エZ@

Add to Reading List

Source URL: w3.cost.eu

Download Document from Source Website

File Size: 1,27 MB

Share Document on Facebook

Similar Documents

Modelling Cubical Type Theory in Agda

Modelling Cubical Type Theory in Agda

DocID: 1uRbJ - View Document

Auto in Agda joint work with Pepijn Kokke APLS Frankfurt, December 2015  Per Martin-Löf

Auto in Agda joint work with Pepijn Kokke APLS Frankfurt, December 2015 Per Martin-Löf

DocID: 1tGcH - View Document

Adding Cubes to Agda Andrea Vezzosi   June 29, 2017

Adding Cubes to Agda Andrea Vezzosi June 29, 2017

DocID: 1tG4t - View Document

Custom definitional equalities in Agda Guillaume Brunerie Université de Nice/Institute for Advanced Study July 14, 2015 ICMS 2016, Berlin

Custom definitional equalities in Agda Guillaume Brunerie Université de Nice/Institute for Advanced Study July 14, 2015 ICMS 2016, Berlin

DocID: 1sXoD - View Document

An Agda Formalisation of the Transitive Closure of Block Matrices (Extended Abstract) Adam Sandberg Eriksson Patrik Jansson

An Agda Formalisation of the Transitive Closure of Block Matrices (Extended Abstract) Adam Sandberg Eriksson Patrik Jansson

DocID: 1sTbz - View Document