BOOK REVIEW: ML for the Working Programmer by Laurence C. Paulson: (Cambridge University Press, 429 pp., 1991)

No abstract is available for this paper.

• Publication year

  1992

• Venue

  SIGP

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1017/cbo9780511811326
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• No references are available for this paper.

• foetus - Termination Checker for Simple Functional Programs

  2024cites this paper
• A Comprehensive Formalization of AADL with Behavior Annex

  2022cites this paper
• Towards the formal performance analysis of multistate coherent systems using HOL theorem proving

  2021cites this paper
• Proof pearl: Braun trees

  2020influential citation
• Verified Textbook Algorithms - A Biased Survey

  2020cites this paper
• Formal reliability and failure analysis of ethernet based communication networks in a smart grid substation

  2020cites this paper
• Formal Verification of Robotic Cell Injection systems up to 4-DOF using HOL Light

  2020cites this paper
• A Survey on Renamings of Software Entities

  2020cites this paper
• Formal Reliability Analysis of an Integrated Power Generation System Using Theorem Proving

  2020cites this paper
• Induction, Coinduction, and Fixed Points in PL Type Theory

  2019cites this paper
• Certification of Breadth-First Algorithms by Extraction

  2019cites this paper
• Induction, Coinduction, and Fixed Points: A Concise Comparative Survey

  2018cites this paper
• Limited Second-Order Functionality in a First-Order Setting

  2018cites this paper
• Formalising Mathematics In Simple Type Theory

  2018influential citation
• Formal Analysis of Continuous-time Systems using Fourier Transform

  2017cites this paper
• Object-Oriented Theorem Proving (OOTP): First Thoughts

  2017influential citation
• Cyber Physical Systems. Design, Modeling, and Evaluation

  2017cites this paper
• Modeling of resource monitoring in federated cloud using Colored Petri Net

  2017cites this paper
• Formal Analysis of Robotic Cell Injection Systems using Theorem Proving

  2017cites this paper
• Explorer A Proposed Categorial Semantics for Pure ML

  2016cites this paper
• Automated managed cloud-platforms based on energy policies

  2016cites this paper
• Proposal for a Bachelor ’ s thesis A compiler for lazy datatypes in Isabelle / HOL

  2016cites this paper
• AUTOMATIC ANALYSIS OF COMPUTER GAME USING COLORED PETRI NET

  2016cites this paper
• The Isabelle/Isar Implementation

  2016cites this paper
• Formalisation and execution of Linear Algebra: theorems and algorithms

  2016cites this paper
• The unforeseen evolution of an ARM verification project

  2015cites this paper
• Modeling Message Queueing Services with Reliability Guarantee in Cloud Computing Environment Using Colored Petri Nets

  2015cites this paper
• Calculational Derivation of Circuits

  2015cites this paper
• Modeling Automatic Generator of Optimal and Minimal Covers of Functional Dependency

  2015cites this paper
• A study of thread-local garbage collection for multi-core systems

  2015cites this paper
• Implementing Persistent O(1) Stacks and Queues in R

  2015cites this paper
• How functional programming mattered

  2015cites this paper
• 40 Years of Formal Methods - Some Obstacles and Some Possibilities?

  2014cites this paper
• Operational Aspects of Full Reduction in Lambda Calculi

  2014influential citation
• Formal Analysis of Steady State Error in Feedback Control Systems

  2014cites this paper
• Rationales and Approaches for Automated Testing of JavaScript and Standard ML

  2014cites this paper
• The Amsterdam Manifesto on OCL

  2014cites this paper
• On the syntactic and functional correspondence between hybrid (or layered) normalisers and abstract machines

  2014cites this paper
• Formally Verifying Graphics FPU - An Intel® Experience

  2014cites this paper
• Modeling Human Behaviour with Higher Order Logic: Insider Threats

  2014cites this paper
• Some Obstacles and Some Possibilities

  2014cites this paper
• Executable Modeling with UML. A Vision or a Nightmare?

  2014cites this paper
• Formalization of Laplace Transform Using the Multivariable Calculus Theory of HOL-Light

  2013cites this paper
• A syntactic and functional correspondence between full-reducing normalisers and full-reducing abstract machines

  2013cites this paper
• Automation of Mathematical Induction as part of the History of Logic

  2013cites this paper
• Konzepte h ¨ oherer Programmiersprachen (Entwurf)

  2013cites this paper
• Teaching programming through problem solving: The role of the programming language

  2013cites this paper
• Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order

  2013cites this paper
• General Computer Science 320201 GenCS I & II Lecture Notes

  2013cites this paper
• Formal Verification of Cyber-Physical Systems: Coping with Continuous Elements

  2013cites this paper
• Artificial intelligence based cognitive routing for cognitive radio networks

  2013cites this paper
• Modeling Kerberos Authentication Protocol Using Colored Petri Net

  2013cites this paper
• Implementation methodology for using concurrent and collaborative approaches for theorem provers, with case studies of SAT and LCF style provers

  2013influential citation
• The Isabelle Cookbook A Gentle Tutorial for Programming on the ML-Level of Isabelle (draft)

  2013cites this paper
• Programming Language Semantics with Isabelle/HOL

  2013cites this paper
• High-Level Abstractions for Safe Parallelism

  2013cites this paper
• The Complexity of Flow Analysis in Higher-Order Languages

  2013cites this paper
• Integrating Experimentation and Proof

  2012cites this paper
• From Concrete Syntax to Abstract Syntax

  2012cites this paper
• Counterexample generation for higher-order logic using functional and logic programming

  2012cites this paper
• The Zen Computational Linguistics Toolkit Version 3.1

  2012cites this paper
• Automatic verification of reduction techniques in Higher Order Logic

  2012cites this paper
• Analysis of the Properties of the Bluetooth Baseband Connection Establishment Using Colored Petri Nets

  2012cites this paper
• The Layer-Oriented Approach to Declarative Languages for Biological Modeling

  2012cites this paper
• Proof Pearl—A Mechanized Proof of GHC’s Mergesort

  2012cites this paper
• Discrimination Nets : Improvement and Extension to Bang Graphs

  2012cites this paper
• Priority Inheritance Protocol Proved Correct

  2012cites this paper
• A Solution to the PoplMark Challenge Using de Bruijn Indices in Isabelle/HOL

  2012cites this paper
• Formal Probabilistic Analysis of Cyber-Physical Transportation Systems

  2012cites this paper
• The Locally Nameless Representation

  2012cites this paper
• Modelling an Automatic Proof Generator for Functional Dependency Rules Using Colored Petri Net

  2012cites this paper
• Test generation and animation based on object-oriented specifications. (Génération de tests et animation à partir de spécifications orientées objet)

  2011cites this paper
• Development of an ML-based Verification Tool for Timed CSP Processes

  2011cites this paper
• The representational adequacy of Hybrid

  2011cites this paper
• A note on the genuine Sieve of Eratosthenes

  2011influential citation
• On the Topology of Discrete Planning with Uncertainty

  2011cites this paper
• Exploring structural symmetry automatically in symbolic trajectory evaluation

  2011cites this paper
• Utilizing Event-B for domain engineering: a critical analysis

  2011cites this paper
• Formal reliability analysis of combinational circuits using theorem proving

  2011cites this paper
• Software Engineering II

  2011influential citation
• Intel CoreTM i7 Processor Execution Engine Validation in a Functional Language Based Formal Framework

  2011cites this paper
• Formalization of continuous Functions in Topological Spaces using Isabelle/HOL

  2011cites this paper
• A separation logic framework for HOL

  2011cites this paper
• An inductive approach to strand spaces

  2011cites this paper
• Gestión mecanizada del conocimiento matemático en topología algebraica

  2011cites this paper
• Formal Verification of Instruction Dependencies in Microprocessors

  2011cites this paper
• A novel formalization of symbolic trajectory evaluation semantics in Isabelle/HOL

  2011cites this paper
• Specifying Rewrite Strategies for Interactive Exercises

  2010cites this paper
• The Beta Cube

  2010cites this paper
• Reconfigurable Embedded Control Systems: Applications for Flexibility and Agility

  2010cites this paper
• Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures

  2010cites this paper
• Automated Termination Analysis for Programs with Second-Order Recursion

  2010cites this paper
• Les grammaires attribuées pour la conception et l'assemblage de langages dédiés

  2010cites this paper
• Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving

  2010cites this paper
• Les grammaires attribuées pour la conception et l'assemblage de langages dédiés. (Attribute Grammars for the Modular Design of Domain Specific Languages)

  2010cites this paper
• VDM-10 Language Manual

  2010cites this paper
• LIVRES PERSONNELS DE NICOLAS CHAPADOS References

  2010cites this paper
• QML: explicit first-class polymorphism for ML

  2009cites this paper
• Enhancements to jml and its extended static checking technology

  2009cites this paper
• Functional Programming at Work in Object-Oriented Programming

  2009cites this paper