Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-22T05:52:23.930Z Has data issue: false hasContentIssue false
  • English
  • Français

Rewriting calculi, higher-order reductions and patterns: introduction

Published online by Cambridge University Press:  01 June 2008

HORATIU CIRSTEA  and
MARIBEL FERNÁNDEZ
HORATIU CIRSTEA
Affiliation:
LORIA and Nancy-Université, 54506 Vandoeuvre-lès-Nancy Cedex, France
MARIBEL FERNÁNDEZ
Affiliation:
King's College London, Department of Computer Science, Strand, London WC2R 2LS, UK.
Get access Rights & Permissions [Opens in a new window]

Extract

The integration of first-order and higher-order paradigms has been one of the main challenges in the design of both declarative programming languages and proof environments. It has led to the development of new computation models and new logical frameworks, which have been obtained by enriching first-order rewriting with higher-order capabilities or by adding algebraic features to the λ-calculus.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 18 , Special Issue 3: Rewriting calculi, higher-order reductions and patterns , June 2008 , pp. 427 - 429
Copyright
Copyright © Cambridge University Press 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)