Functional programming : (Registro nro. 13134)
[ vista simple ]
000 -Cabecera | |
---|---|
Campo de control de longitud fija | 07647nam a2200277 a 4500 |
003 - Identificador del Número de control | |
Identificador del número de control | AR-sfUTN |
008 - Códigos de información de longitud fija-Información general | |
Códigos de información de longitud fija | 170717b ||||| |||| 00| 0 d |
020 ## - ISBN | |
ISBN | 0201137445 |
040 ## - Fuente de la catalogación | |
Centro transcriptor | AR-sfUTN |
041 ## - Código de lengua | |
Código de lengua del texto | eng |
080 ## - CDU | |
Clasificación Decimal Universal | 004.42 M224 |
Edición de la CDU | 2000 |
100 1# - Punto de acceso principal-Nombre de persona | |
Nombre personal | MacLennan, Bruce J. |
245 10 - Mención de título | |
Título | Functional programming : |
Resto del título | practice and theory / |
Mención de responsabilidad | Bruce J. MacLennan. |
260 ## - Publicación, distribución, etc. (pie de imprenta) | |
Lugar de publicación, distribución, etc. | Reading, Massachusetts: |
Nombre del editor, distribuidor, etc. | Addison-Wesley, |
Fecha de publicación, distribución, etc. | 1990 |
300 ## - Descripción física | |
Extensión | 596 p. |
336 ## - Tipo de contenido | |
Fuente | rdacontent |
Término de tipo de contenido | texto |
Código de tipo de contenido | txt |
337 ## - Tipo de medio | |
Fuente | rdamedia |
Nombre del tipo de medio | sin mediación |
Código del tipo de medio | n |
338 ## - Tipo de soporte | |
Fuente | rdacarrier |
Nombre del tipo de soporte | volumen |
Código del tipo de soporte | nc |
505 80 - Nota de contenido con formato | |
Nota de contenido con formato | CONTENIDO<br/>Part 1 Practice 1<br/>Chapter 1. Functions 3<br/>1.1 Introduction 3<br/>1.2 The World of Expressions and the World of Statements 5<br/>1.3 Evaluation-Order Independence 7<br/>1.4 Referential Transparency 11<br/>1.5 Manifest Interfaces 13<br/>1.6 Hoare's Principles of Structuring 14<br/>1.7 Functions and Applicative Expressions 15<br/>1.8 Function Definition 17<br/>1.9 History of Functional Programming 23<br/>1.10 Functional Programming Languages 26<br/>1.11 The Structure of Functional Programs 32<br/>Chapter 2. Applicative Languages 36<br/>2.1 Language Frameworks 36<br/>2.2 Atomic Data Types 38<br/>2.3 Sequences 41<br/>2.4 Exploration of Sequence Primitives 44<br/>2.5 Engineering Specifications 49<br/>2.6 Archtypes for Abstract Data Types 50<br/>2.7 Syntax 52<br/>2.8 Semantics 55<br/>2.9 Pragmatics 61<br/>2.10 The Problem of Infinite Sequences 62<br/>Chapter 3. Applicative Sequence Processing 67<br/>3.1 Goals 67<br/>3.2 Element Selection 68<br/>3.3 Catenation 73<br/>3.4 Reductions 80<br/>3.5 Mappings 84<br/>3.6 Sequence Generation 87<br/>3.7 Sequence Equality 91<br/>3.8 Performance Analysis and Optimization 94<br/>3.9 Tail Recursion and Iteration 101<br/>3.10 Copying in Applicative Languages 112<br/>Chapter 4. Applicative Set Processing 114<br/>4.1 Archetypes and Prototypes 114<br/>4.2 Archetype for Finite Sets 115<br/>4.3 Applications of Finite Sets 127<br/>4.4 Development of a Prototype for Finite Sets 129<br/>4.5 Typing in Applicative Languages 133<br/>4.6 Proof of Finite Set Prototype 138<br/>4.7 Performance Analysis of Finite Set Prototype 143<br/>4.8 Choice Functions and Multiple Representations 145<br/>4.9 Archetype for Finite Functions 151<br/>4.10 Applications of Finite Functions 157<br/>4.11 Prototype for Finite Functions 159<br/>Chapter 5. Applicative Tree Processing 162<br/>5.1 Direct Products of Types 162<br/>5.2 Direct Sums of Types 171<br/>5.3 Recursively Defined Types 180<br/>5.4 Formal Patterns and Equational Definitions 188<br/>5.5 Arithmetic Expression Notations 194<br/>5.6 Representing Arithmetic Expressions 196<br/>5.7 Descriptions of Expression Representations 198<br/>5.8 Tree-to-Postfix Conversion 200<br/>5.9 Tree Evaluation 203<br/>5.10 Unification 209<br/>Chapter 6. Higher-Order Functions 221<br/>6.1 Functional Mapping 221<br/>6.2 Definition of Functional Programming 227<br/>6.3 Functional Abstraction 228<br/>6.4 Functional Abstraction and Mapping 236<br/>6.5 Sections of Binary Operators 240<br/>6.6 Currying 243<br/>6.7 Filtering 246<br/>6.8 Composition 250<br/>6.9 Construction 254<br/>6.10 Function-Level Definitions and Multilevel Functions 262<br/>6.11 The Reduction Functionals 265<br/>6.12 The Accumulation Functionals 272<br/>6.13 Constant Functions 276<br/>6.14 Conditional Construction 278<br/>6.15 Functional Summation 282<br/>6.16 Recursively Defined Functionals 288<br/>Chapter 7. Infinite Data Structures 294<br/>7.1 Introduction 294<br/>7.2 Recursive Sets 294<br/>7.3 Extension and Intension 298<br/>7.4 An Application: Recognitive Grammars 302<br/>7.5 Recursively Enumerable Sequences 310<br/>7.6 Evaluation Order and the Recursive Definition of Data Structures 316<br/>7.7 Delayed Evaluation and Streams 323<br/>7.8 Interactive and Real-time Applications 334<br/>Part 2 Theory 349<br/>Chapter 8. Completeness of the Lambda Calculus 350<br/>8.1 Introduction 350<br/>8.2 Bound Identifiers 351<br/>8.3 Syntax of the Lambda Calculus 357<br/>8.4 Semantics of the Lambda Calculus 359<br/>8.5 Normal Form 364<br/>8.6 Multiple Parameters and Abbreviations 367<br/>8.7 Typing in the Lambda Calculus 370<br/>8.8 Booleans and Conditionals 371<br/>8.9 Direct Product Types 374<br/>8.10 Direct Sum Types and Sequences 377<br/>8.11 Auxiliary Declarations 379<br/>8.12 Recursive Declarations 383<br/>8.13 Integers 391<br/>Chapter 9. Consistency of the Lambda Calculus 398<br/>9.1 History 398<br/>9.2 Notation and Terminology 399<br/>9.3 Reachability and Uniqueness of Normal Form 402<br/>9.4 Walks 404<br/>9.5 Walks Are Substitutive 405<br/>9.6 Walks Have the Diamond Property 408<br/>9.7 Reduction Has the Diamond Property 412<br/>9.8 Introduction to the Halting Problem 414<br/>9.9 Undecidability of the Halting Problem 417<br/>Chapter 10. Abstract Calculi 421<br/>10.1 Advantages and Disadvantages of Calculi 421<br/>10.2 Definition of Calculi 423<br/>10.3 Transformation Rules 424<br/>10.4 Disadvantages of Concrete Calculi 425<br/>10.5 Expression Trees 431<br/>10.6 Abstract Syntax 433<br/>10.7 Equations and Transformation Rules 435<br/>10.8 The Abstract Lambda Calculus 438<br/>10.9 The SKI Calculus 442<br/>10.10 The Wang Algorithm for the Propositional Calculus 441<br/>10.11 Computational Consistency 455<br/>10.12 Implementation 463<br/>Chapter 11. Universal Functions 471<br/>11.1 The Utility of Universal Functions 471<br/>11.2 Mechanical Reduction 473<br/>11.3 Context 474<br/>11.4 Free Identifiers 479<br/>11.5 Automating Reduction 481<br/>11.6 A Functional Program for Lambda Calculus Reduction 483<br/>11.7 An Imperative Program for Lambda Calculus Reduction 488<br/>11.8 Functional Language Interpreters 490<br/>11.9 Representation of Contexts 490<br/>11.10 Multiple-Argument Functions 492<br/>11.11 Constants 495<br/>11.12 Intrinsic Identifiers 499<br/>11.13 Auxiliary Declarations 506<br/>Chapter 12. Evaluation Order and Recursion 510<br/>12.1 Pass-by-Value or Pass-by-Name? 510<br/>12.2 Strict or Lenient Semantics? 514<br/>12.3 Inheritance of Evaluation Order 515<br/>12.4 Conditionals 517<br/>12.5 Reetirsive Declarations with Normal-Order Languages 519<br/>12.6 Recursive Declarations with Recursive Data Structures 520<br/>12.7 Recursive Declarations with Delayed Expressions 521<br/>12.8 Recursive Function Declarations with Imperative Features 523<br/>12.9 Recursive Function Declarations with Y-Closures 525<br/>12.10 Compound Recursive Function Declarations 531<br/>12.11 Recursive Data Structures 537<br/>Chapter 13. Whither Functional Programming? 541<br/>References 544<br/>Appendix A: The Functional Language (fi) 552<br/>A1 Grammatical Notation 552<br/>A2 Grammar 553<br/>A3 ASCII Representation of (fi) 555<br/>Appendix B: Collected Archetypes 557<br/>B.1 Boolean Type 557<br/>B.2 Integer Type 558<br/>B.3 String Type 559<br/>B.4 Sequence Types 559<br/>B.5 Finite Set Types 560<br/>B.6 Finite Function Types 561<br/>B.7 Direct Product Types 562<br/>B.8 Structure Declarations for Direct Products 562<br/>B.9 Direct Sum Types 563<br/>B.10 Structure Declarations for Direct Sums 564<br/>B.11 Trivial Type 564<br/>B.12 Map and Filter Functionals 565<br/>B.13 Composition 565<br/>B.14 Functional Construction 565<br/>B.15 Reduction and Accumulation Functionals 566<br/>B.16 Constant Construction 566<br/>B.17 Conditional Construction 566<br/>B.18 Functional Direct Sum and Alternation 567<br/>B.19 Pretest Conditional 567<br/>B.20 Recursive Set Types 567<br/>B.21 Recursively Enumerable Sequence Types 568<br/>B.22 Stream Types 568<br/>Appendix C: Functional Programming in Scheme and LISP 569<br/>C.1 General 569<br/>C.2 Declarations 570<br/>C.3 Applications and Abstractions 571<br/>C.4 Booleans 571<br/>C.5 Numbers 572<br/>C.6 Strings 572<br/>C.7 Sequences 572<br/>C.8 Finite Sets 573<br/>C.9 Finite Functions 574<br/>C.10 Direct Products, Sums, and Structures 574<br/>C.11 Streams 575<br/>C.12 Functionals 575<br/>Index of Notation 576<br/>Index 579<br/> |
650 ## - Punto de acceso adicional de materia - Término de materia | |
Término de materia | FUNCTIONAL PROGRAMMING LANGUAGES |
650 ## - Punto de acceso adicional de materia - Término de materia | |
Término de materia | FUNCTIONAL PROGRAMMING (COMPUTER SCIENCE) |
650 ## - Punto de acceso adicional de materia - Término de materia | |
Término de materia | PROGRAMACION DE ORDENADORES |
650 ## - Punto de acceso adicional de materia - Término de materia | |
Término de materia | PROGRAMACION FUNCIONAL |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Tipo de ítem Koha | Libro |
Esquema de clasificación | Clasificación Decinal Universal |
Estado | Estado perdido | Estado de conservación | Tipo de préstamo | Biblioteca | Biblioteca | Fecha de adquisición | Origen de la adquisición | Número de inventario | Total Checkouts | ST completa de Koha | Código de barras | Date last seen | Date last checked out | Precio efectivo a partir de | Tipo de ítem Koha |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Sólo Consulta | Facultad Regional Santa Fe - Biblioteca "Rector Comodoro Ing. Jorge Omar Conca" | Facultad Regional Santa Fe - Biblioteca "Rector Comodoro Ing. Jorge Omar Conca" | 02/02/2018 | Donación Depto. Sistemas | 10191 | 3 | 004.42 M224 | 10191 | 12/04/2024 | 03/04/2024 | 02/02/2018 | Libro |