Skip to search formSkip to main contentSemantic Scholar

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

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

2007

2007

Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type… Expand

Is this relevant?

2006

2006

We prove that every functor on the category Meas of measurable spaces built from the identity and constant functors using… Expand

Is this relevant?

2006

2006

Abstract The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (small class) of formulas… Expand

Is this relevant?

2004

2004

This paper connects coalgebra with a long discussion in the foundations of game theory on the modeling of type spaces. We argue… Expand

Is this relevant?

2003

2003

We present an extension of first-order term rewriting systems, which involves variable binding in the term language. We develop… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

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

Is this relevant?

2000

2000

A safety device for preventing a worker working in a high place from falling. The device has a flat and hollow case and a rope… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

In the semantics of programming, finite data types such as finite lists, have traditionally been modelled by initial algebras… Expand

Is this relevant?

1995

1995

Formal methods have not been accepted to the extent for which many computing scientists hoped. This paper explores some reasons… Expand

Is this relevant?

Review

1977

Review

1977

Many apparently divergent approaches to specifying formal semantics of programming languages are applications of initial algebra… Expand

Is this relevant?