Lilac: a functional programming language based on linear logic

DOI10.1017/S0956796800001131zbMATH Open0817.68042MaRDI QIDQ4764609FDOQ4764609

Authors: Ian Mackie 

Publication date: 4 May 1995

Published in: Journal of Functional Programming (Search for Journal in Brave)

Recommendations

• Computational interpretations of linear logic
• A polytime functional language from light linear logic
• Lambda calculus and intuitionistic linear logic
• scientific article; zbMATH DE number 4055576

zbMATH Keywords

intuitionistic linear logic

Mathematics Subject Classification ID

Theory of programming languages (68N15) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• Linear logic
• Computational interpretations of linear logic
• An internal language for autonomous categories
• A Machine-Oriented Logic Based on the Resolution Principle
• A Transformation System for Developing Recursive Programs
• Title not available (Why is that?)
• Explicit substitutions

Cited In (12)

• A general adequacy result for a linear functional language
• \( \pi\) with leftovers: a mechanisation in Agda
• Polymorphic lambda calculus with context-free session types
• A polytime functional language from light linear logic
• Gödel's system \(\mathcal T\) revisited
• Practical affine types
• Reference counting as a computational interpretation of linear logic
• Programs with continuations and linear logic
• The best of both worlds: linear functional programming without compromise
• Preface to the special volume
• Subtyping for session types in the pi calculus
• Linearity and iterator types for Gödel's system \(\mathcal T\)

Uses Software

• Lilac

This page was built for publication: Lilac: a functional programming language based on linear logic

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