Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

There are several different approaches to the theory of data types. At the simplest level, polynomials and containers give a…

2012

2012

This article describes two stages of a study carried out with pre-university students, to gather information about the learning…

2012

2012

Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of…

Review

2011

Review

2011

Programming languages based on dependent type theory promise two great advances: flexibility and security. With the type-level…

2010

2010

ML5 is a programming language for spatially distributed computing, based on a Curry-Howard correspondence with the modal logic S5…

2007

2007

We address the problem of representing mathematical structures in a proof assistant which: 1) is based on a type theory with…

2006

2006

Abstract An indexed inductive definition (IID) is a simultaneous inductive definition of an indexed family of sets. An inductive…

Highly Cited

2006

Highly Cited

2006

We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool…

Highly Cited

2003

Highly Cited

2003

Induction-recursion is a powerful definition method in intuitionistic type theory. It extends (generalized) inductive definitions…

2001

2001

We give two finite axiomatizations of indexed inductive-recursive definitions in intuitionistic type theory. They extend our…