Skip to search formSkip to main content

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

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

2018

2018

A cornerstone of theoretical computer science is the Curry-Howard correspondence where formulas are types, proofs are programs… Expand

Is this relevant?

2014

2014

The Λμ-calculus is an extension of Parigot’s λμ-calculus. For the untyped Λμ-calculus, Saurin proved some fundamental properties… Expand

Is this relevant?

Highly Cited

2013

Highly Cited

2013

Background: Immune dysfunction, including monocytosis and increased blood levels of interleukin-1, interleukin-6 and tumour… Expand

Is this relevant?

2007

2007

Categorial grammars in the tradition of Lambek [1,2] are asymmetric: sequent statements are of the form Γ ⇒ A, where the… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We consider the relation of the dual calculus of Wadler(2003) to the λμ-calculus of Parigot (1992). We give translations from the… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

Carbon nanotubes are potentially ideal atomic force microscopy (AFM) probes due to their well-defined geometry, robust mechanical… Expand

Is this relevant?

2002

2002

We show that a certain simple call-by-name continuation semantics of Parigot's λµ -calculus is complete. More precisely, for… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

We give a categorical semantics to the call-by-name and call-by-value versions of Parigot's λμ-calculus with disjunction types… Expand

Is this relevant?

2001

2001

Abstract The typed λμ-calculus is known to be strongly normalizing and weakly Church-Rosser, and hence becomes confluent. In fact… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

We construct a translation of first order λΜ-calculus [15] into a subtheory of Felleisen's λc-calculus [5, 6]. This translation… Expand

Is this relevant?