The following pages link to Functional and Logic Programming (Q2798252):
Displayed 50 items.
- From Sets to Bits in Coq (Q2798253) (← links)
- From Proposition to Program (Q2798255) (← links)
- The Boolean Constraint Solver of SWI-Prolog (System Description) (Q2798256) (← links)
- Probabilistic Inference by Program Transformation in Hakaru (System Description) (Q2798260) (← links)
- An Interaction Net Encoding of Gödel’s System $$\mathcal {T}$$ (Q2798262) (← links)
- Space-Efficient Planar Acyclicity Constraints (Q2798264) (← links)
- Executable Relational Specifications of Polymorphic Type Systems Using Prolog (Q2798266) (← links)
- Proof Relevant Corecursive Resolution (Q2798268) (← links)
- A Coq Library for Internal Verification of Running-Times (Q2798271) (← links)
- A Transformational Approach to Parametric Accumulated-Cost Static Profiling (Q2798274) (← links)
- Polymorphic Types in Erlang Function Specifications (Q2798275) (← links)
- Declarative Foreign Function Binding Through Generic Programming (Q2798279) (← links)
- Incremental Computing with Abstract Data Structures (Q2798280) (← links)
- Declarative Programming with Algebra (Q2798283) (← links)
- Call-by-Value Solvability, Revisited (Q2900255) (← links)
- Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts (Q2900256) (← links)
- Normal Form Bisimulations for Delimited-Control Operators (Q2900257) (← links)
- Extending the $\mathcal{TOY}$ System with the ECL i PS e Solver over Sets of Integers (Q2900259) (← links)
- Correct Looping Arrows from Cyclic Terms (Q2900260) (← links)
- A Lambda Calculus for Gödel–Dummett Logic Capturing Waitfreedom (Q2900262) (← links)
- Mutual Exclusion by Interpolation (Q2900264) (← links)
- Calculational Developments of New Parallel Algorithms for Size-Constrained Maximum-Sum Segment Problems (Q2900265) (← links)
- Coinductive Constraint Logic Programming (Q2900266) (← links)
- A Call-by-Name CPS Hierarchy (Q2900268) (← links)
- Exact Flow Analysis by Higher-Order Model Checking (Q2900270) (← links)
- Computing in Cantor’s Paradise with λ ZFC (Q2900271) (← links)
- “Scrap Your Boilerplate” Reloaded (Q3434621) (← links)
- Ruler: Programming Type Rules (Q3434622) (← links)
- A Framework for Extended Algebraic Data Types (Q3434624) (← links)
- Lock Free Data Structures Using STM in Haskell (Q3434626) (← links)
- XML Type Checking Using High-Level Tree Transducer (Q3434627) (← links)
- A Computational Approach to Pocklington Certificates in Type Theory (Q3434628) (← links)
- Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant (Q3434629) (← links)
- A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems (Q3434630) (← links)
- Resource Analysis by Sup-interpretation (Q3434631) (← links)
- Lazy Set-Sharing Analysis (Q3434632) (← links)
- Size-Change Termination and Bound Analysis (Q3434633) (← links)
- Typed Contracts for Functional Programming (Q3434634) (← links)
- Contracts as Pairs of Projections (Q3434635) (← links)
- A Church-Style Intermediate Language for ML F (Q3558327) (← links)
- ΠΣ: Dependent Types without the Sugar (Q3558328) (← links)
- Haskell Type Constraints Unleashed (Q3558329) (← links)
- A Functional Framework for Result Checking (Q3558330) (← links)
- Tag-Free Combinators for Binding-Time Polymorphic Program Generation (Q3558331) (← links)
- Code Generation via Higher-Order Rewrite Systems (Q3558332) (← links)
- A Complete Axiomatization of Strict Equality (Q3558333) (← links)
- Standardization and Böhm Trees for Λμ-Calculus (Q3558334) (← links)
- An Integrated Distance for Atoms (Q3558336) (← links)
- A Pearl on SAT Solving in Prolog (Q3558337) (← links)
- Automatically Generating Counterexamples to Naive Free Theorems (Q3558338) (← links)