Open AccessBook
ML for the working programmer
Lawrence C. Paulson
- 01 Jan 1991
635
TL;DR: In teaching the methods of functional programming, how to program in Standard ML, a functional language recently developed at Edinburgh University, the author shows how to use such concepts as lists, trees, higher-order functions and infinite data structures.
read more
Abstract: From the Publisher:
In teaching the methods of functional programming--in particular, how to program in Standard ML, a functional language recently developed at Edinburgh University, the author shows how to use such concepts as lists, trees, higher-order functions and infinite data structures.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Types and Programming Languages
Benjamin C. Pierce
- 01 Jan 2002
TL;DR: This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages, with a variety of approaches to modeling the features of object-oriented languages.
2.7K
•Book
Modelling with Generalized Stochastic Petri Nets
M. Ajmone Marsan,Gianfranco Balbo,G. Conte,Susanna Donatelli,Giuliana Franceschinis +4 more
- 28 Nov 1995
TL;DR: This book presents a unified theory of Generalized Stochastic Petri Nets together with a set of illustrative examples from different application fields to show how this methodology can be applied in a range of domains.
1.6K
Collaboration Processes: Inside the Black Box
Ann Marie Thomson,James L. Perry +1 more
TL;DR: The authors argue that public managers should look inside the "black box" of collaboration processes and find a complex construct of five variable dimensions: governance, administration, organizational autonomy, mutuality, and norms.
1.4K
A sound type system for secure flow analysis
TL;DR: This work forms Denning’s approach as a type system and presents a notion of soundness for the system that can be viewed as a form of noninterference.
The inductive approach to verifying cryptographic protocols
TL;DR: Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions, which are based on ordinary predicate calculus and copes with infinite-state systems.
Related Papers (5)
Robin Milner,Mads Tofte,Robert Harper +2 more
- 01 Jan 1990
Michael J. C. Gordon,Tom Melham +1 more
- 01 Aug 1993
Tobias Nipkow,Markus Wenzel,Lawrence C. Paulson +2 more
- 01 Jan 2002