FEEDBACK Smiley face
Normal view MARC view ISBD view

Functional and Logic Programming [electronic resource] :5th International Symposium, FLOPS 2001 Tokyo, Japan, March 7–9, 2001 Proceedings /

Contributor(s): Kuchen, Herbert [editor.] | Ueda, Kazunori [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 2024Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2001.Description: X, 398 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540447160.Subject(s): Computer science | Computer programming | Programming languages (Electronic computers) | Computer logic | Artificial intelligence | Computer Science | Programming Languages, Compilers, Interpreters | Programming Techniques | Logics and Meanings of Programs | Artificial Intelligence (incl. Robotics)Online resources: Click here to access online
Contents:
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in