From parametric polymorphism to models of polymorphic FPC

DOI10.1017/S096012950900766XzbMath1172.68009OpenAlexW2072002861MaRDI QIDQ3395309

Rasmus Ejlers Møgelberg

Publication date: 26 August 2009

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096012950900766x

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65) Categorical semantics of formal languages (18C50) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• A small complete category
• Semantics of weakening and contraction
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• Relational properties of domains
• Monads on symmetric monoidal closed categories
• Strong functors and monoidal monads
• Free theorems in the presence of seq
• Data Types as Lattices
• Axiomatic Domain Theory in Categories of Partial Maps
• Categorical models for Abadi and Plotkin's logic for parametricity

This page was built for publication: From parametric polymorphism to models of polymorphic FPC