Skip to search formSkip to main content>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.

Highly Cited

2013

Highly Cited

2013

In this paper, we study strong normalization of a core language based on System F-omega which supports programming with finite… Expand

2012

2012

Co-recursion is the ability of defining a function that produces some infinite data in terms of the function and the data itself… Expand

2012

2012

Type systems certify program properties in a compositional way. From a bigger program one can abstract out a part and certify the… Expand

2008

2008

We propose a (limited) solution to the problem of constructing stream values defined by recursive equations that do not respect… Expand

2008

2008

In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee… Expand

Highly Cited

2004

Highly Cited

2004

This paper introduces $\lambda^\widehat$, a simply typed lambda calculus supporting inductive types and recursive function… Expand

2003

2003

We derive and factorize the fourth-order difference equations satisfied by orthogonal polynomials obtained from some… Expand

2002

2002

In type theory based logical frameworks, recursive and corecursive definitions are subject to syntactic restrictions that ensure… Expand

Highly Cited

2001

Highly Cited

2001

This paper gives a treatment of substitution for \parametric" objects in nal coalgebras, and also presents principles of… Expand

Highly Cited

1994

Highly Cited

1994

We formalize an extension of the Calculus of Constructions with inductive and coinductive types which allows a more direct… Expand