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
3 months 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
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted