1 option
Functional and Logic Programming : 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010, Proceedings / edited by Matthias Blume, Naoki Kobayashi, Germán Vidal-Oriola.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024)- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 6009.
- Theoretical Computer Science and General Issues ; 6009
- Language:
- English
- Subjects (All):
- Computer programming.
- Software engineering.
- Computer logic.
- Programming languages (Electronic computers).
- Logic, Symbolic and mathematical.
- Artificial intelligence.
- Programming Techniques.
- Software Engineering.
- Logics and Meanings of Programs.
- Programming Languages, Compilers, Interpreters.
- Mathematical Logic and Formal Languages.
- Artificial Intelligence.
- Local Subjects:
- Programming Techniques.
- Software Engineering.
- Logics and Meanings of Programs.
- Programming Languages, Compilers, Interpreters.
- Mathematical Logic and Formal Languages.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (XI, 355 pages) : 46 illustrations.
- Edition:
- First edition 2010.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
- System Details:
- text file PDF
- Contents:
- Invited Talks
- Beluga: Programming with Dependent Types, Contextual Data, and Contexts
- Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs
- Solving Constraint Satisfaction Problems with SAT Technology
- Refereed Papers
- A Church-Style Intermediate Language for ML F
- ??: Dependent Types without the Sugar
- Haskell Type Constraints Unleashed
- A Functional Framework for Result Checking
- Tag-Free Combinators for Binding-Time Polymorphic Program Generation
- Code Generation via Higher-Order Rewrite Systems
- A Complete Axiomatization of Strict Equality
- Standardization and Böhm Trees for ??-Calculus
- An Integrated Distance for Atoms
- A Pearl on SAT Solving in Prolog
- Automatically Generating Counterexamples to Naive Free Theorems
- Applying Constraint Logic Programming to SQL Test Case Generation
- Internal Normalization, Compilation and Decompilation for System
- Towards Normalization by Evaluation for the ??-Calculus of Constructions
- Defunctionalized Interpreters for Call-by-Need Evaluation
- Complexity Analysis by Graph Rewriting
- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and ?-Calculus
- Proving Injectivity of Functions via Program Inversion in Term Rewriting
- Delimited Control in OCaml, Abstractly and Concretely: System Description
- Automatic Parallelization of Recursive Functions Using Quantifier Elimination
- A Skeleton for Distributed Work Pools in Eden.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-12251-4
- 9783642122514
- 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.