scientific article; zbMATH DE number 65531
From MaRDI portal
Publication:4012879
zbMATH Open0760.68014MaRDI QIDQ4012879FDOQ4012879
Authors: Frank Pfenning 
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 4072431
- scientific article; zbMATH DE number 194376
- scientific article; zbMATH DE number 841929
- scientific article; zbMATH DE number 1531964
- scientific article; zbMATH DE number 3872640
- Logic programming in a fragment of intuitionistic linear logic
- scientific article; zbMATH DE number 750013
- scientific article; zbMATH DE number 1215501
- scientific article; zbMATH DE number 1070626
- scientific article; zbMATH DE number 4076677
Cited In (56)
- Automated techniques for provably safe mobile code.
- Structural cut elimination. I: Intuitionistic and classical logic
- Representing unification in a logical framework
- Role of logic programming in the FGCS project
- Logic programming: laxness and saturation
- A practical implementation of simple consequence relations using inductive definitions
- Functional and Logic Programming
- Title not available (Why is that?)
- The Twelf Proof Assistant
- A graph-theoretic approach to sequent derivability in the Lambek calculus
- Fuzzy types: A framework for handling uncertainty about types of objects
- A framework for defining logical frameworks
- Programmed strategies for program verification
- Unification with extended patterns
- In praise of impredicativity: a contribution to the formalization of meta-programming
- TWAM: a certifying abstract machine for logic programs
- Title not available (Why is that?)
- Celf – A Logical Framework for Deductive and Concurrent Systems (System Description)
- Primitive recursion for higher-order abstract syntax
- Linear unification of higher-order patterns
- Verifying termination and reduction properties about higher-order logic programs
- Title not available (Why is that?)
- Higher-order substitutions
- A linear logical framework
- Encoding a dependent-type λ-calculus in a logic programming language
- Programming inductive proofs. A new approach based on contextual types
- Elf
- Login: a logic programming language with built-in inheritance
- Semantics for abstract clauses
- Logical frameworks
- Representing proof transformations for program optimization
- Decidable higher-order unification problems
- Logical frameworks. Why not just classical logic?
- A note on the proof theory of the \(\lambda \Pi\)-calculus
- A representation of \(F_{\omega}\) in LF
- Implementing tactics and tacticals in a higher-order logic programming language
- Unification under a mixed prefix
- Higher-order superposition for dependent types
- Modular AC unification of higher-order patterns
- Frontiers of Combining Systems
- Relative properties of frame language
- A framework for defining logics
- Title not available (Why is that?)
- Elf: A meta-language for deductive systems
- Structured theory presentations and logic representations
- Proof-search in type-theoretic languages: An introduction
- A framework for linguistic logic programming
- Using typed lambda calculus to implement formal systems on a machine
- Title not available (Why is that?)
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Focusing the inverse method for LF: a preliminary report
- Imperative LF meta-programming
- Program development schemata as derived rules
- The practice of logical frameworks
- Title not available (Why is that?)
- Higher order disunification: some decidable cases
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012879)
