Local and asynchronous beta-reduction (an analysis of Girard's execution formula)

Vincent Danos, Laurent Regnier

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

The authors build a confluent, local, asynchronous reduction on λ-terms, using infinite objects (partial injections of Girard's (1988) algebra L*), which is simple (only one move), intelligible (semantic setting of the reduction), and general (based on a large-scale decomposition of β), and may be mechanized
Original languageEnglish
Title of host publicationLogic in Computer Science, 1993. LICS '93., Proceedings of Eighth Annual IEEE Symposium on
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages11
ISBN (Print)0-8186-3140-6
Publication statusPublished - Jun 1993

Keywords / Materials (for Non-textual outputs)

  • lambda calculus
  • λ-terms
  • Girard's execution formula
  • L* algebra
  • confluent local asynchronous beta-reduction
  • infinite objects
  • large-scale decomposition
  • mechanizabilty
  • partial injections
  • semantic setting
  • single move reduction
  • Algebra
  • Geometry
  • Glass
  • Large-scale systems
  • Logic
  • Microscopy


Dive into the research topics of 'Local and asynchronous beta-reduction (an analysis of Girard's execution formula)'. Together they form a unique fingerprint.

Cite this