000 04757nam a22005895i 4500
001 978-3-540-47950-5
003 DE-He213
005 20240423132538.0
007 cr nn 008mamaa
008 121227s1999 gw | s |||| 0|eng d
020 _a9783540479505
_9978-3-540-47950-5
024 7 _a10.1007/10705424
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aFunctional and Logic Programming
_h[electronic resource] :
_b4th Fuji International Symposium, FLOPS'99 Tsukuba, Japan, November 11-13, 1999 Proceedings /
_cedited by Aart Middeldorp, Taisuke Sato.
250 _a1st ed. 1999.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1999.
300 _aX, 378 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1722
505 0 _aSemantics and Types in Functional Logic Programming -- Polytypic Programming With Ease -- Type Inference for Overloading without Restrictions, Declarations or Annotations -- Partial Evaluation and Non-interference for Object Calculi -- Lazy Lexing is Fast -- A Functional-Logic Perspective of Parsing -- Implementing Encapsulated Search for a Lazy Functional Logic Language -- Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers -- Automatic Verification Based on Abstract Interpretation -- A Transformation System for Lazy Functional Logic Programs -- Termination Analysis of Tabled Logic Programs Using Mode and Type Information -- On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems -- An Interval Lattice-Based Constraint Solving Framework for Lattices -- Higher Order Matching for Program Transformation -- Automated Generalisation of Function Definitions -- An Extensional Characterization of Lambda-Lifting and Lambda-Dropping -- Using Types as Approximations for Type Checking Prolog Programs -- Typed Static Analysis: Application to Groundness Analysis of Prolog and ? Prolog -- A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs -- The Logical Abstract Machine: A Curry-Howard Isomorphism for Machine Code -- On Reducing the Search Space of Higher-Order Lazy Narrowing -- Typed Higher-Order Narrowing without Higher-Order Strategies -- A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages.
520 _aThis volume contains the papers presented at the 4th Fuji International S- posium on Functional and Logic Programming (FLOPS’99) held in Tsukuba, Japan, November 11–13, 1999, and hosted by the Electrotechnical Laboratory (ETL). FLOPS is a forum for presenting and discussing all issues concerning functional programming, logic programming, and their integration. The sym- sium takes place about every 1.5 years in Japan. Previous FLOPS meetings were held in Fuji Susuno (1995), Shonan Village (1996), and Kyoto (1998). 1 There were 51 submissions from Austria ( ),Belgium (2),Brazil(3),China 3 3 1 7 (1), Denmark (2), France (3 ), Germany (8), Ireland (1), Israel ( ), Italy (1 ), 4 3 12 1 Japan (9 ), Korea (1), Morocco (1), The Netherlands (1), New Zealand (1), 3 1 1 3 5 Portugal ( ), Singapore ( ), Slovakia (1), Spain (4 ), Sweden (1), UK (4 ), 2 3 4 6 1 and USA (2 ), of which the program committee selected 21 for presentation. In 4 addition, this volume contains full papers by the two invited speakers, Atsushi Ohori and Mario Rodr´?guez-Artalejo.
650 0 _aComputer programming.
650 0 _aCompilers (Computer programs).
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 1 4 _aProgramming Techniques.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aArtificial Intelligence.
700 1 _aMiddeldorp, Aart.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSato, Taisuke.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540666776
776 0 8 _iPrinted edition:
_z9783662169544
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1722
856 4 0 _uhttps://doi.org/10.1007/10705424
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188952
_d188952