𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for type-checking dependent types

✍ Scribed by Thierry Coquand

Book ID
107918633
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
678 KB
Volume
26
Category
Article
ISSN
0167-6423

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Type-checking in an untyped language
Type-checking in an untyped language
✍ Allan Ramsay πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science βš– 620 KB

It is argued that typed variables and functions are inappropriate for languages which allow functional arguments, data types defined by predicates, and conditional expressions that test data types. However, it is still possible to do some compile-time type-checking for such languages. This paper pre

An Optimal Algorithm for Checking Regula
An Optimal Algorithm for Checking Regularity
✍ Kohayakawa, Y.; RΓΆdl, V.; Thoma, L. πŸ“‚ Article πŸ“… 2003 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 281 KB
Type inference and strong static type ch
Type inference and strong static type checking for Promela
✍ Alastair F. Donaldson; Simon J. Gay πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 750 KB

The Spin model checker and its specification language Promela have been used extensively in industry and academia to check the logical properties of distributed algorithms and protocols. Model checking with Spin involves reasoning about a system via an abstract Promela specification, thus the techni