Specification of data structures for FP programs

Authors:
Geoffrey A. Frank
Affiliations:
ESL Incorporated, 2249 Zanker Road, San Jose, CA
Venue:
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Year:
1981

Citing 7
Cited 2

Proving Theorems about LISP Functions

Journal of the ACM (JACM)
Notation as a tool of thought

Communications of the ACM
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
A Discipline of Programming

A Discipline of Programming
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended Definitions

Proceedings of the International Colloquium on Formalization of Programming Concepts
Programming in reduction languages.

Programming in reduction languages.

Static type inference in a dynamically typed language

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference and type checking for functional programming languages: A reduced computation approach

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

An essential part of an FP programmer's task is keeping track of the intermediate data structures of an FP program. This paper describes a way of documenting FP program with descriptions of its data structures and automatically proving that this documentation is accurate.