LEDA : a blending of imperative and relational programming

Technical Report

公开 Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/technical_reports/70795881x

Descriptions

Attribute Name	Values
Creator	Oregon State University. Dept. of Computer Science Budd, Timothy
Abstract	This paper describes features of a new strongly typed, compiled programming language, called LEDA. LEDA attempts to combine aspects of both imperative (value-oriented) and logical (relation-oriented) styles of programming. Logical behavior is introduced by means of a new programming structure, called a relation. Relations have similarities to functions and procedures, but are distinct from both. Several examples are presented illustrating how the combination of features from the two paradigms are mutually beneficial. Finally a short overview of the implementation is given.
Resource Type	Research Paper
Date Available	2012-04-06T21:05:43+00:00
Date Issued	1994-09-20
Series	Technical report (Oregon State University. Department of Computer Science)
Subject	Leda (Computer program language)
权利声明	Copyright Not Evaluated
Publisher	Corvallis, OR : Oregon State University, Dept. of Computer Science
Peer Reviewed	No
Language	English [eng]
Replaces	http://hdl.handle.net/1957/28610

缩略图	标题	上传日期	公开度	行动
	LEDA_a_blending_of_imperative_and_relational_programming.pdf	2017-07-18	公开	下载