In general, an expression language provides a means to indicate non-constant values in expressions. It includes operations to combine values, but these will normally disappear when the expression is evaluated. HTEL is an expression language to produce HTML-documents. It is presented to stimulate a discussion about the structure of hypertext expression languages. The operations have been chosen in agreement with what is strongly suggested, but not defined, by the HTML-standard. The HTEL-interpreter can be used for cgi-programs, i.e. to describe reactions when data from a ‘form’ in an HTML-document has been submitted. A special tool has been used to build the HTEL-interpreter, as an example belonging to a family of interpreters for domain-specific languages. Members of that family have characteristics that are closely related to structural patterns found in the mark-ups of HTML. HTEL should also be seen as a substantial example to witness the applicability and relevance of the principles that are applied in the tool used for constructing its interpreter. Copyright © 1999 John Wiley & Sons, Ltd.

A systematic representation of objects grouped into types by constructions similar to the composition of sets in mathematics is proposed. The representation is by lambda expressions, which supports the representation of objects from function spaces. The representation is related to a rather conventional language of type descriptions in a way that is believed to be new. Ordinary control-expressions (i.e.,case- and let-expressions) are derived from the proposed representation.

Abstract This paper gives an introduction to programs used to prepare the layout of a text for publication. It presents a suitable terminology, independent of any particular systems but in no way complete, for the description of documents. The basic characteristics of phototypesetting equipment are described. Finally, highlights of a particular system are given. Very little is said on the implementation of that system.

Abstract A technique is presented by which the programming language Pascal as defined by the expected standard, can be used to write programs divided into modules containing mutually hidden information. The technique fits nicely with the programming by stepwise refinement methodology, combines top‐down and bottom‐up methods, and illustrates that stepwise refinement does not necessarily lead to simple tree‐like programs. Limitations for the application of the technique with Pascal are pointed out.

article Free Access Share on A Statement-Oriented Approach to Data Abstraction Author: J. Steensgaard-Madsen DIKU, Sigurdsgade 41, DK-2200 Copenhagen N, Denmark DIKU, Sigurdsgade 41, DK-2200 Copenhagen N, DenmarkView Profile Authors Info & Claims ACM Transactions on Programming Languages and SystemsVolume 3Issue 1Jan. 1981 pp 1–10https://doi.org/10.1145/357121.357122Published:01 January 1981Publication History 8citation211DownloadsMetricsTotal Citations8Total Downloads211Last 12 Months5Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF