VSL 2014: VIENNA SUMMER OF LOGIC 2014

This page contains an index consisting of author-provided keywords.

A
Agda	An Embedded Hardware Description Language using Dependent Types
avoidability	Sequential decision problems and a computational theory of avoidability
C
coercions	A Unifying Framework for Primitive Ontological Relations in Dependent Type Theory
Coinductive Types	Terminal semantics for codata types in intensional Martin-Löf type theory
Coq	Terminal semantics for codata types in intensional Martin-Löf type theory
D
datatypes à la carte	Relational ornaments
dependent type theory	A Unifying Framework for Primitive Ontological Relations in Dependent Type Theory
dependent types	Type-Directed Editing for Dependently-Typed Programs. An Embedded Hardware Description Language using Dependent Types Tool Demonstration: An IDE for Programming and Proving in Idris
dependently typed languaged	Sequential decision problems and a computational theory of avoidability
Dependently-typed programming	Scrapping Your Dependently-Typed Boilerplate is Hard An Embedded Hardware Description Language using Dependent Types
E
editing	Type-Directed Editing for Dependently-Typed Programs.
F
Formal verification	An Embedded Hardware Description Language using Dependent Types
formalization	Sequential decision problems and a computational theory of avoidability
functional programming	On a style of presentation of type systems Domain Specific Languages of Mathematics
G
generic programming	Sequential decision problems and a computational theory of avoidability Scrapping Your Dependently-Typed Boilerplate is Hard
H
Hardware design	An Embedded Hardware Description Language using Dependent Types
I
IDE	Tool Demonstration: An IDE for Programming and Proving in Idris
intensional Martin-Löf type theory	Terminal semantics for codata types in intensional Martin-Löf type theory
L
linear algebra	Domain Specific Languages of Mathematics
M
mathematics education	Domain Specific Languages of Mathematics
meaning explanations	On a style of presentation of type systems
mereology	A Unifying Framework for Primitive Ontological Relations in Dependent Type Theory
N
non-linear optimization	Domain Specific Languages of Mathematics
O
ornament	Relational ornaments
P
parallel composition	Relational ornaments
part-whole	A Unifying Framework for Primitive Ontological Relations in Dependent Type Theory
programming	Tool Demonstration: An IDE for Programming and Proving in Idris
proving	Tool Demonstration: An IDE for Programming and Proving in Idris
R
reachability	Sequential decision problems and a computational theory of avoidability
real analyis	Domain Specific Languages of Mathematics
S
Scrap Your Boilerplate	Scrapping Your Dependently-Typed Boilerplate is Hard
semantics	Type-Directed Editing for Dependently-Typed Programs.
sequential decision problems	Sequential decision problems and a computational theory of avoidability
subsumption	A Unifying Framework for Primitive Ontological Relations in Dependent Type Theory
T
terminal semantics	Terminal semantics for codata types in intensional Martin-Löf type theory
Type systems	On a style of presentation of type systems
type theory	Domain Specific Languages of Mathematics
type-directed editing	Type-Directed Editing for Dependently-Typed Programs.
types	Type-Directed Editing for Dependently-Typed Programs.
V
viability	Sequential decision problems and a computational theory of avoidability

Disclaimer | Powered by EasyChair Smart Program