R.I.P.
👻
Ghosted
Nominal Unification of Higher Order Expressions with Recursive Let
August 12, 2016 · Declared Dead · 🏛 International Workshop/Symposium on Logic-based Program Synthesis and Transformation
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret
arXiv ID
1608.03771
Category
cs.PL: Programming Languages
Cross-listed
cs.LO
Citations
26
Venue
International Workshop/Symposium on Logic-based Program Synthesis and Transformation
Last Checked
1 month ago
Abstract
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also explore specializations like nominal letrec-matching for plain expressions and for DAGs and determine the complexity of corresponding unification problems.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Programming Languages
R.I.P.
👻
Ghosted
Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions
R.I.P.
👻
Ghosted
Glow: Graph Lowering Compiler Techniques for Neural Networks
R.I.P.
👻
Ghosted
Learnable Programming: Blocks and Beyond
R.I.P.
👻
Ghosted
Scenic: A Language for Scenario Specification and Scene Generation
R.I.P.
👻
Ghosted
Vandal: A Scalable Security Analysis Framework for Smart Contracts
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Language Models are Few-Shot Learners
R.I.P.
👻
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
👻
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
👻
Ghosted