1 option
Functional and Logic Programming : 5th International Symposium, FLOPS 2001, Tokyo, Japan, March 7-9, 2001. Proceedings / edited by Herbert Kuchen, Kazunori Ueda.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2024.
- Lecture Notes in Computer Science, 0302-9743 ; 2024
- Language:
- English
- Subjects (All):
- Programming languages (Electronic computers).
- Computer programming.
- Computer logic.
- Artificial intelligence.
- Programming Languages, Compilers, Interpreters.
- Programming Techniques.
- Logics and Meanings of Programs.
- Artificial Intelligence.
- Local Subjects:
- Programming Languages, Compilers, Interpreters.
- Programming Techniques.
- Logics and Meanings of Programs.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (X, 398 pages).
- Edition:
- First edition 2001.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
- System Details:
- text file PDF
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-44716-0
- 9783540447160
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.