The following pages link to Functional and Logic Programming (Q2798252):
Displayed 46 items.
- Applying Constraint Logic Programming to SQL Test Case Generation (Q3558339) (← links)
- Internal Normalization, Compilation and Decompilation for System ${\mathcal F}_{\beta\eta}$ (Q3558340) (← links)
- Towards Normalization by Evaluation for the βη-Calculus of Constructions (Q3558341) (← links)
- Defunctionalized Interpreters for Call-by-Need Evaluation (Q3558342) (← links)
- Complexity Analysis by Graph Rewriting (Q3558343) (← links)
- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (Q3558344) (← links)
- Proving Injectivity of Functions via Program Inversion in Term Rewriting (Q3558345) (← links)
- Automatic Parallelization of Recursive Functions Using Quantifier Elimination (Q3558346) (← links)
- Guided Type Debugging (Q5170701) (← links)
- Using Big-Step and Small-Step Semantics in Maude to Perform Declarative Debugging (Q5170702) (← links)
- On Cross-Stage Persistence in Multi-Stage Programming (Q5170704) (← links)
- Lightweight Higher-Kinded Polymorphism (Q5170706) (← links)
- Generic Programming with Multiple Parameters (Q5170707) (← links)
- Type-Based Amortized Resource Analysis with Integers and Arrays (Q5170708) (← links)
- Linear Sized Types in the Calculus of Constructions (Q5170709) (← links)
- Dynamic Programming via Thinning and Incrementalization (Q5170711) (← links)
- POSIX Regular Expression Parsing with Derivatives (Q5170712) (← links)
- Proving Correctness of Compilers Using Structured Graphs (Q5170713) (← links)
- A New Formalization of Subtyping to Match Subclasses to Subtypes (Q5170715) (← links)
- Type Soundness and Race Freedom for Mezzo (Q5170717) (← links)
- Semantics for Prolog with Cut – Revisited (Q5170718) (← links)
- Constraint Logic Programming for Hedges: A Semantic Reconstruction (Q5170719) (← links)
- How Many Numbers Can a Lambda-Term Contain? (Q5170720) (← links)
- AC-KBO Revisited (Q5170721) (← links)
- Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata (Q5170722) (← links)
- Model-Based Knowledge Representation and Reasoning Via Answer Set Programming (Q5458423) (← links)
- On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory (Q5458424) (← links)
- Substructural Type Systems for Program Analysis (Q5458425) (← links)
- Integrating Answer Set Reasoning with Constraint Solving Techniques (Q5458426) (← links)
- Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base (Q5458427) (← links)
- Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl) (Q5458428) (← links)
- On-Demand Refinement of Dependent Types (Q5458429) (← links)
- Proving Properties about Lists Using Containers (Q5458431) (← links)
- Termination of Narrowing in Left-Linear Constructor Systems (Q5458432) (← links)
- Complexity Analysis by Rewriting (Q5458433) (← links)
- Rewriting and Call-Time Choice: The HO Case (Q5458434) (← links)
- Semantics and Pragmatics of New Shortcut Fusion Rules (Q5458435) (← links)
- A Generalization of the Folding Rule for the Clark-Kunen Semantics (Q5458436) (← links)
- Types for Hereditary Head Normalizing Terms (Q5458437) (← links)
- A New Translation for Semi-classical Theories — Backtracking without CPS (Q5458438) (← links)
- Typed Dynamic Control Operators for Delimited Continuations (Q5458440) (← links)
- Strictness Analysis Algorithms Based on an Inequality System for Lazy Types (Q5458441) (← links)
- Quantitative Logic Programming Revisited (Q5458442) (← links)
- Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation (Q5458443) (← links)
- Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming (Q5458444) (← links)
- Equivalence Checking of Non-deterministic Operations (Q5886123) (← links)