On the correctness of pull-tabbing

DOI10.1017/S1471068411000263zbMath1222.68050arXiv1108.0190MaRDI QIDQ3087454

Sergio Antoy

Publication date: 16 August 2011

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.0190

zbMATH Keywords

graph rewritingnondeterminismfunctional logic programmingpull-tabbing

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

Compiling a Functional Logic Language: The Fair Scheme ⋮ Unnamed Item

Cites Work

• On a Tighter Integration of Functional and Logic Programming
• Term Rewriting and All That
• Rewriting and Call-Time Choice: The HO Case

This page was built for publication: On the correctness of pull-tabbing