


default search action
5. FLOPS 2001: Tokyo, Japan
- Herbert Kuchen, Kazunori Ueda:

Functional and Logic Programming, 5th International Symposium, FLOPS 2001, Tokyo, Japan, March 7-9, 2001, Proceedings. Lecture Notes in Computer Science 2024, Springer 2001, ISBN 3-540-41739-7
Invited Papers
- Gopalan Nadathur:

The Metalanguage lambda-Prolog and Its Implementation. 1-20 - George C. Necula:

A Scalable Architecture for Proof-Carrying Code. 21-39 - Taisuke Sato

:
Parameterized Logic Programs where Computing Meets Learning. 40-60
Functional Programming
- Jeff Polakow, Kwangkeun Yi:

Proving Syntactic Properties of Exceptions in an Ordered Logical Framework. 61-77 - Olivier Danvy

, Lasse R. Nielsen:
A Higher-Order Colon Translation. 78-91 - Kwanghoon Choi, Hyun-il Lim, Taisook Han:

Compiling Lazy Functional Programs Based on the Spineless Tagless G-Machine for the Java Virtual Machine. 92-107
Logic Programming
- Javier Leach, Susana Nieva

:
A Higher-Order Logic Programming Language with Constraints. 108-122 - Giorgio Delzanno:

Specifying and Debugging Security Protocols via Hereditary Harrop Formulas and \lambda Prolog - A Case-study. 123-137 - Marco Bozzano, Giorgio Delzanno, Maurizio Martelli:

An Effective Bottom-Up Semantics for First-Order Linear Logic Programs. 138-152
Functional Logic Programming
- Jesús Manuel Almendros-Jiménez

, Antonio Becerra-Terón
:
A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs. 153-169 - Rafael Caballero

, Francisco Javier López-Fraguas
, Mario Rodríguez-Artalejo:
Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs. 170-184 - Wolfgang Lux:

Adding Linear Constraints over Real Numbers to Curry. 185-200 - Taro Suzuki, Aart Middeldorp

:
A Complete Selection Function for Lazy Conditional Narrowing. 201-215 - Maria Teresa Hortalá-González, Eva Ullán:

An Abstract Machine Based System for a Lazy Narrowing Calculus. 216-232 - César Ferri, José Hernández-Orallo, M. José Ramírez-Quintana

:
Incremental Learning of Functional Logic Programs. 233-247
Types
- Martin Sulzmann:

A General Type Inference Framework for Hindley/Milner Style Systems. 248-263 - Koji Kagawa:

Monadic Encapsulation with Stack of Regions. 264-279 - Pierre Deransart, Jan-Georg Smaus:

Well-Typed Logic Programs Are not Wrong. 280-295
Program Analysis and Transformation
- Vitaly Lagoon, Peter J. Stuckey:

A Framework for Analysis of Typed Logic Programs. 296-310 - Gianluca Amato, Fausto Spoto

:
Abstract Compilation for Sharing Analysis. 311-325 - Elvira Albert, Michael Hanus

, Germán Vidal
:
A Practical Partial Evaluator for a Multi-Paradigm Declarative Language. 326-342 - Olivier Danvy

, Morten Rhiger:
A Simple Take on Typed Abstract Syntax in Haskell-like Languages. 343-358
lambda-Calculus
- Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama:

A Simply Typed Context Calculus with First-Class Environments. 359-374 - Fairouz Kamareddine, Twan Laan, Rob Nederpelt:

Refining the Barendregt Cube Using Parameters. 375-390

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














