LISP

swMATH7201MaRDI QIDQ19253FDOQ19253

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Metamodeling semantics of multiple inheritance
• Title not available (Why is that?)
• Confluently persistent tries for efficient version control
• The Impact of the Lambda Calculus in Logic and Computer Science
• Architectures and monitoring techniques for active databases: An evaluation
• Directly reflective meta-programming
• An algorithm for dual transformation in first-order logic
• New operations research and artificial intelligence approaches to traffic engineering problems
• Logic programming in the context of multiparadigm programming: the Oz experience
• Title not available (Why is that?)
• Symbolic Lie algebras manipulations using COMMON LISP
• Title not available (Why is that?)
• Interleaving natural language parsing and generation through uniform processing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Flexible software architectures for ontology-based information systems
• A review of Mathematica
• A Mechanically Checked Proof of IEEE Compliance of the Floating Point Multiplication, Division and Square Root Algorithms of the AMD-K7^™ Processor
• The revised report on the syntactic theories of sequential control and state
• Constructive algebraic topology
• Integrating external deduction tools with ACL2
• Formal correctness of a quadratic unification algorithm
• Debugging hygienic macros
• Design and evaluation of C++ open multi-methods
• A theory for program and data type specification
• The Mathematical-Function Computation Handbook
• Title not available (Why is that?)
• Title not available (Why is that?)
• On proving the termination of algorithms by machine
• A tight, practical integration of relations and functions.
• Linearized dynamics equations for the balance and steer of a bicycle: a benchmark and review
• Structured theory development for a mechanized logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Processing Poisson series in parallel
• Generalization in the presence of free variables: A mechanically-checked correctness proof for one algorithm
• Computational complexity via programming languages: Constant factors do matter
• Title not available (Why is that?)
• Evolutionary synthesis of low-sensitivity digital filters using adjacency matrix
• A verified common lisp implementation of Buchberger's algorithm in ACL2
• A constructive logic behind the catch and throw mechanism
• An environment for DEVS-based multiformalism simulation in common lisp/CLOS
• PARALLEL MATRIX MULTIPLICATION ON THE CONNECTION MACHINE
• A motorcycle model for stability and control analysis
• Meta-circular interpreter for a strongly typed language
• Netl and subsequent path-based inheritance theories
• A systematic catalogue of reusable abstract data types
• The expressive power of higher-order types or, life without CONS
• Formal proofs about rewriting using ACL2
• Modular statically typed multimethods
• Explicit and implicit solution of the Navier-Stokes equations on a massively parallel computer
• Programming Languages and Systems
• Revised6 Report on the Algorithmic Language Scheme
• Shallow confluence of conditional term rewriting systems
• A mechanically verified incremental garbage collector
• A functional approach to generic programming using adaptive traversals
• Label-selective \(\lambda\)-calculus syntax and confluence
• Elements with embedded localization zones for large deformation problems
• An ACL2 Tutorial
• Random list permutations in place
• Essential Maple 7
• An object-oriented interpretation of the EAT system
• Title not available (Why is that?)
• Introduction to the GiNaC framework for symbolic computation within the \(\text{C}^{++}\) programming language
• Recursive functions of symbolic expressions and their computation by machine, Part I
• Strong normalizability of the non-deterministic catch/throw calculi
• Logic Programming
• A list processing language TAO with multiple programming paradigms
• Efficient execution in an automated reasoning environment
• EMERGENCE OF COMPLEX STRATEGIES IN THE EVOLUTION OF CHESS ENDGAME PLAYERS
• Title not available (Why is that?)
• Equality in computer algebra and beyond.
• Title not available (Why is that?)
• Title not available (Why is that?)
• How to evaluate the performance of gradual type systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Second order optimization methods in \texttt{LISP}
• Title not available (Why is that?)
• A proposal for error handling in OpenMP
• Computing Environments for Data Analysis III: Programming Environments
• Title not available (Why is that?)
• Modality via iterated enrichment
• A form-based meta-model for software composition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Milestones from the Pure Lisp Theorem Prover to ACL2
• Limited second-order functionality in a first-order setting
• Formal basis for the refinement of rule based transition systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Trojan Horses of Thompson-Goerigk-Type, Their Generation, Intrusion, Detection and Prevention
• PROMOT: A Modeling Tool for Chemical Processes
• Defining actions in concurrent declarative programming
• Title not available (Why is that?)
• Numerical continuation of solutions and bifurcation analysis in multibody systems applied to motorcycle dynamics
• More haste, less speed: lazy versus eager evaluation
• On congruence relations and equations of Shimura curves

This page was built for software: LISP