Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Programming --- 681.3*F41 --- 681.3*I23 --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23}

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Espaces de Teichmuller --- Quasiconformal mappings --- Riemann [Oppervlakten van ] --- Riemann [Surfaces de ] --- Riemann surfaces --- Teichmuller [Ruimten van ] --- Teichmuller spaces --- 514.7 --- Spaces, Teichmüller --- Functions of several complex variables --- Differential geometry. Algebraic and analytic methods in geometry --- 514.7 Differential geometry. Algebraic and analytic methods in geometry --- Quadratic differentials --- Teichmüller spaces --- Surfaces, Riemann --- Functions --- Mappings, Quasiconformal --- Conformal mapping --- Functions of complex variables --- Geometric function theory --- Mappings (Mathematics) --- Differentials, Quadratic

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Programming --- Computer science --- Mathematical logic --- Computable functions --- Data structures (Computer science) --- 681.3*F11 --- 681.3*F41 --- 681.3*I23 --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Constructive mathematics --- Decidability (Mathematical logic) --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Informatique --- Computer science. --- Sémantique --- Logique mathématique --- Informatique theorique --- Programmation logique

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume describes recent research in graph reduction and related areas of functional and logic programming, as reported at a workshop in 1986. The papers are based on the presentations, and because the final versions were prepared after the workshop, they reflect some of the discussions as well. Some benefits of graph reduction can be found in these papers: - A mathematically elegant denotational semantics - Lazy evaluation, which avoids recomputation and makes programming with infinite data structures (such as streams) possible - A natural tasking model for fine-to-medium grain parallelism. The major topics covered are computational models for graph reduction, implementation of graph reduction on conventional architectures, specialized graph reduction architectures, resource control issues such as control of reduction order and garbage collection, performance modelling and simulation, treatment of arrays, and the relationship of graph reduction to logic programming.

Computer science --- 681.3*C1 --- 681.3*D11 --- 681.3*D34 --- 681.3*F11 --- 681.3*F41 --- Processor architectures (Computer systems organization) --- Applicative (functional) programming --- Processors: code generation; compilers; interpreters; optimization; parsing; preprocessors; run-time environments; translator writing systems and compilergenerators (Programming languages) --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- 681.3*D34 Processors: code generation; compilers; interpreters; optimization; parsing; preprocessors; run-time environments; translator writing systems and compilergenerators (Programming languages) --- 681.3*D11 Applicative (functional) programming --- 681.3*C1 Processor architectures (Computer systems organization) --- Mathematics. --- Computer network architectures. --- Computer science. --- Mathematics, general. --- Computer System Implementation. --- Computation by Abstract Devices. --- Mathematical Logic and Formal Languages. --- Processor Architectures. --- Programming Techniques. --- Informatics --- Science --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Math

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science --- 681.3*F22 --- 681.3*F41 --- 681.3*F42 --- 681.3*I23 --- Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*F42 Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Computer software. --- Artificial intelligence. --- Computer science. --- Logic, Symbolic and mathematical. --- Algebra. --- Algorithm Analysis and Problem Complexity. --- Artificial Intelligence. --- Mathematical Logic and Formal Languages. --- Mathematical Logic and Foundations. --- Mathematics --- Mathematical analysis --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Informatics --- Science --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Software, Computer --- Computer systems