Safe typing of functional logic programs with opaque patterns and local bindings
From MaRDI portal
(Redirected from Publication:2437797)
Recommendations
Cites work
- scientific article; zbMATH DE number 1696588 (Why is no real title available?)
- scientific article; zbMATH DE number 1696604 (Why is no real title available?)
- scientific article; zbMATH DE number 3874579 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- Automatically generating counterexamples to naive free theorems
- Complete and decidable type inference for GADTs
- Depth-First Search and Linear Graph Algorithms
- Extra variables can be eliminated from functional logic programs
- Free theorems in the presence of seq
- Guarded recursive datatype constructors
- Multi-paradigm Declarative Languages
- New results on type systems for functional logic programming
- Overlapping Rules and Logic Variables in Functional Logic Programs
- Polymorphic types in functional logic programming
- Rewriting and Call-Time Choice: The HO Case
Cited in
(2)
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)