Safe typing of functional logic programs with opaque patterns and local bindings

DOI10.1016/J.IC.2014.01.004zbMATH Open1358.68058OpenAlexW2029044760MaRDI QIDQ2437797FDOQ2437797

Authors: Enrique Martin-Martin, Juan Rodríguez-Hortalá, F. J. López-Fraguas 

Publication date: 13 March 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.01.004

Recommendations

• New results on type systems for functional logic programming
• A liberal type system for functional logic programs
• Polymorphic types in functional logic programming
• A type system for logic programs
• scientific article; zbMATH DE number 1696583

zbMATH Keywords

type systemsfunctional-logic programminglet bindingsopaque patterns

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18)

Cites Work

• Depth-First Search and Linear Graph Algorithms
• Title not available (Why is that?)
• Multi-paradigm Declarative Languages
• Complete and decidable type inference for GADTs
• Guarded recursive datatype constructors
• Title not available (Why is that?)
• Polymorphic types in functional logic programming
• Automatically generating counterexamples to naive free theorems
• Free theorems in the presence of seq
• Extra variables can be eliminated from functional logic programs
• Overlapping Rules and Logic Variables in Functional Logic Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• New results on type systems for functional logic programming
• Rewriting and Call-Time Choice: The HO Case

Cited In (1)

• New results on type systems for functional logic programming

Uses Software

• TOY

This page was built for publication: Safe typing of functional logic programs with opaque patterns and local bindings

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