Functional and Logic Programming 5th International Symposium, FLOPS 2001, Tokyo, Japan, March 7-9, 2001. Proceedings /
Functional and Logic Programming 5th International Symposium, FLOPS 2001, Tokyo, Japan, March 7-9, 2001. Proceedings / [electronic resource] :
edited by Herbert Kuchen, Kazunori Ueda.
- 1st ed. 2001.
- X, 398 p. online resource.
- Lecture Notes in Computer Science, 2024 1611-3349 ; .
- Lecture Notes in Computer Science, 2024 .
Invited Papers -- The Metalanguage ?prolog and Its Implementation -- A Scalable Architecture for Proof-Carrying Code -- Parameterized Logic Programs where Computing Meets Learning -- Functional Programming -- Proving Syntactic Properties of Exceptions in an Ordered Logical Framework -- A Higher-Order Colon Translation -- Compiling Lazy Functional Programs Based on the Spineless Tagless G-machine for the Java Virtual Machine -- Logic Programming -- A Higher-Order Logic Programming Language with Constraints -- Specifying and Debugging Security Protocols via Hereditary Harrop Formulas and ?Prolog ? A Case-study ? -- An Effective Bottom-Up Semantics for First-Order Linear Logic Programs -- Functional Logic Programming -- A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs -- Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs -- Adding Linear Constraints over Real Numbers to Curry -- A Complete Selection Function for Lazy Conditional Narrowing -- An Abstract Machine Based System for a Lazy Narrowing Calculus -- Incremental Learning of Functional Logic Programs -- Types -- A General Type Inference Framework for Hindley/Milner Style Systems -- Monadic Encapsulation with Stack of Regions -- Well-Typed Logic Programs Are not Wrong -- Program Analysis and Transformation -- A Framework for Analysis of Typed Logic Programs -- Abstract Compilation for Sharing Analysis -- A Practical Partial Evaluator for a Multi-Paradigm Declarative Language -- A Simple Take on Typed Abstract Syntax in Haskell-like Languages -- Calculus -- A simply typed context calculus with first-class environments -- Refining the Barendregt Cube using Parameters.
9783540447160
10.1007/3-540-44716-4 doi
Compilers (Computer programs).
Computer programming.
Computer science.
Artificial intelligence.
Compilers and Interpreters.
Programming Techniques.
Computer Science Logic and Foundations of Programming.
Artificial Intelligence.
QA76.76.C65
005.45
Invited Papers -- The Metalanguage ?prolog and Its Implementation -- A Scalable Architecture for Proof-Carrying Code -- Parameterized Logic Programs where Computing Meets Learning -- Functional Programming -- Proving Syntactic Properties of Exceptions in an Ordered Logical Framework -- A Higher-Order Colon Translation -- Compiling Lazy Functional Programs Based on the Spineless Tagless G-machine for the Java Virtual Machine -- Logic Programming -- A Higher-Order Logic Programming Language with Constraints -- Specifying and Debugging Security Protocols via Hereditary Harrop Formulas and ?Prolog ? A Case-study ? -- An Effective Bottom-Up Semantics for First-Order Linear Logic Programs -- Functional Logic Programming -- A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs -- Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs -- Adding Linear Constraints over Real Numbers to Curry -- A Complete Selection Function for Lazy Conditional Narrowing -- An Abstract Machine Based System for a Lazy Narrowing Calculus -- Incremental Learning of Functional Logic Programs -- Types -- A General Type Inference Framework for Hindley/Milner Style Systems -- Monadic Encapsulation with Stack of Regions -- Well-Typed Logic Programs Are not Wrong -- Program Analysis and Transformation -- A Framework for Analysis of Typed Logic Programs -- Abstract Compilation for Sharing Analysis -- A Practical Partial Evaluator for a Multi-Paradigm Declarative Language -- A Simple Take on Typed Abstract Syntax in Haskell-like Languages -- Calculus -- A simply typed context calculus with first-class environments -- Refining the Barendregt Cube using Parameters.
9783540447160
10.1007/3-540-44716-4 doi
Compilers (Computer programs).
Computer programming.
Computer science.
Artificial intelligence.
Compilers and Interpreters.
Programming Techniques.
Computer Science Logic and Foundations of Programming.
Artificial Intelligence.
QA76.76.C65
005.45