scientific article; zbMATH DE number 1479634

zbMATH Open0942.03508MaRDI QIDQ4490749FDOQ4490749

Authors: Philippa Gardner 

Publication date: 20 July 2000

Title of this publication is not available (Why is that?)

Recommendations

• Needed reduction and spine strategies for the lambda calculus
• Call-by-need, neededness and all that
• Decidable call-by-need computations in term rewriting
• A decidable theory of type assignment
• Reasoning about call-by-need by means of types

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Cited In (21)

• Title not available (Why is that?)
• Characterization of the principal type of normal forms in an intersection type system
• Minimal relative normalization in orthogonal expression reduction systems
• Tight typings and split bounds, fully developed
• Inhabitation for non-idempotent intersection types
• Title not available (Why is that?)
• Title not available (Why is that?)
• Intersection type assignment systems
• The spirit of node replication
• Quantitative weak linearisation
• A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications
• Reasoning about call-by-need by means of types
• Node Replication: Theory And Practice
• The bang calculus revisited
• Optimizing optimal reduction
• The bang calculus revisited
• A correspondence between type checking via reduction and type checking via evaluation
• Title not available (Why is that?)
• A resource aware semantics for a focused intuitionistic calculus
• Title not available (Why is that?)
• Structural rules and algebraic properties of intersection types

Uses Software

• Miranda

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4490749)