NDLI: GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept

Content Provider	ACM Digital Library
Author	Reynolds, John C.
Abstract	GEDANKEN is an experimental programming language with the following characteristics. (1) Any value which is permitted in some context of the language is permissible in any other meaningful context. In particular, functions and labels are permissible results of functions and values of variables. (2) Assignment and indirect addressing are formalized by introducing values, called references, which in turn possess other values. The assignment operation always affects the relation between some reference and its value. (3) All compound data structures are treated as functions. (4) Type declarations are not permitted.The functional approach to data structures and the use of references insure that any process which accepts some data structure will accept any logically equivalent structure, regardless of its internal representation. More generally, any data structure may be implicit; i.e. it may be specified by giving an arbitrary algorithm for computing or accessing its components. The existence of label variables permits the construction of co-routines, quasi-parallel processes, and other unorthodox control mechanisms.A variety of programming examples illustrates the generality of the language. Limitations and possible extensions are discussed briefly.
Starting Page	308
Ending Page	319
Page Count	12
File Format	PDF
ISSN	00010782 15577317
DOI	10.1145/362349.362364
Journal	Communications of the ACM (CACM)
Volume Number	13
Issue Number	5
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2005-08-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Assignment Typeless language List processing Programming language Nondeterministic algorithm Lambda calculus Reference Coroutine Data structure Quasi-parallel process Applicative language
Content Type	Text
Resource Type	Article
Subject	Computer Science Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

GEDANKEN - a simple typeless language based on the principle of completeness and the reference concept (1970)

Definitional interpreters for higher-order programming languages

Reasoning about pointers in refinement calculus (2003)

Reasoning about pointers in refinement calculus (2003)

Equivalence of Applicative Functors and Multifunctors

Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB (2014)

Intrinsically Typed Sessions With Callbacks

The lambda mechanism in lambda calculus and in other calculi

Simply easy! an implementation of a dependently typed lambda calculus (2007).

GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept

Similar Documents

GEDANKEN - a simple typeless language based on the principle of completeness and the reference concept (1970)

Definitional interpreters for higher-order programming languages

Reasoning about pointers in refinement calculus (2003)

Reasoning about pointers in refinement calculus (2003)

Equivalence of Applicative Functors and Multifunctors

Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB (2014)

Intrinsically Typed Sessions With Callbacks

The lambda mechanism in lambda calculus and in other calculi

Simply easy! an implementation of a dependently typed lambda calculus (2007).

GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept