scientific article; zbMATH DE number 7455733

MaRDI QIDQ5020992zbMATH OpenFDO

Authors Finn Teegen

Publication date 11 January 2022

Full work available at URL https://arxiv.org/abs/2009.10254, http://eptcs.web.cse.unsw.edu.au/paper.cgi?ICLP2020.39

Mathematics Subject Classification ID

Logic programming (68N17)

Cites work

• scientific article; zbMATH DE number 1612493 (Why is no real title available?)
• A Relation Algebraic Semantics for a Lazy Functional Logic Language
• An approach to declarative programming based on a rewriting logic
• An universal resolving algorithm for inverse computation of lazy languages
• Automatic Partial Inversion of Inductively Sequential Functions
• CurryCheck: checking properties of Curry programs
• Declarative Programming with Function Patterns
• Equivalence Checking of Non-deterministic Operations
• Functional and Logic Programming
• Implementing a library for probabilistic programming using non-strict non-determinism
• Term Rewriting and Applications
• The universal resolving algorithm and its correctness: Inverse computation in a functional language

Describes a project that uses

Uses Software

• EasyCheck
• TOY
• PFLP

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 Q5020992)