article

Free access

An online editor

Authors:

L. Peter Deutsch,

Butler W. LampsonAuthors Info & Claims

Communications of the ACM, Volume 10, Issue 12

Pages 793 - 799

https://doi.org/10.1145/363848.363863

Published: 01 December 1967 Publication History

PDF eReader

Abstract

An online, interactive system for text editing is described in detail, with remarks on the theoretical and experimental justification for its form. Emphasis throughout the system is on providing maximum convenience and power for the user. Notable features are its ability to handle any piece of text, the content-searching facility, and the character-by-character editing operations. The editor can be programmed to a limited extent.

References

[1]

CRISMAN, P. A. (ED.). The Compatible Time-Sharing System: A Programmer's Guide, 2nd ed. MIT Press, Cambridge, Mass., 1965, Section AH.9.01.

Google Scholar

[2]

ARANDA, S. M. Q-32 Time-sharing system user's guide, executive service: context editing (EDTXT). SDC-TM-2708/204/ 00, Sys. Devel. Corp., Santa Monica, Calif., Mar. 1966.

Google Scholar

[3]

LAMPSON, B. W., LICHTENBERGER, W. W., AND PIRTLE, M. W. A user machine in a time-sharing system. Proc. IEEE 54, 12 (Dec. 1966), 1766-1774.

Crossref

Google Scholar

[4]

ANGLUIN, D. C., AND DEUTSCH, L. P. Reference manual: QED Time-sharing editor. Project Genie Doc. R-15, U. of California, Berkeley, Calif., Jan. 1967.

Google Scholar

[5]

FARBER, D. J., GRISWOLD, R. E., AND POLONSKY, I. P. The SNOBOL3 programming language. Bell Sys. Tech. J. 45, 6 (July 1966), 845-944.

Crossref

Google Scholar

[6]

MURPHY, D. TECO. Memorandum, Bolt, Beranek and Newman, Cambridge, Mass. (Nov. 1966).

Google Scholar

Cited By

View all

Ulus DFerrère TAsarin ENickovic DMaler O(2024)Elements of Timed Pattern MatchingACM Transactions on Embedded Computing Systems10.1145/364511423:4(1-45)Online publication date: 10-Feb-2024
https://dl.acm.org/doi/10.1145/3645114
Ritchie DThompson K(2022)The Unix Time-Sharing SystemClassic Operating Systems10.1007/978-1-4757-3510-9_11(195-220)Online publication date: 3-Aug-2022
https://doi.org/10.1007/978-1-4757-3510-9_11
Anzt HCojean TYen-Chen CDongarra JFlegar GNayak PTomov STsai YWang W(2020)Load-balancing Sparse Matrix Vector Product Kernels on GPUsACM Transactions on Parallel Computing10.1145/33809307:1(1-26)Online publication date: 29-Mar-2020
https://dl.acm.org/doi/10.1145/3380930
Show More Cited By

Index Terms

An online editor
1. Applied computing
  1. Document management and text processing
    1. Document management
      1. Text editing

Recommendations

Online Advertising: Experimental Facts on Ethics, Involvement, and Product Type

The purpose of this chapter is to provide some insights into advertisements on the Iranian websites. Firstly, in publisher side, is the ethic a matter of fact in accepting Internet advertisements to publish? Second, to provide a preliminary insight into ...
Online Display Advertising: Targeting and Obtrusiveness

We use data from a large-scale field experiment to explore what influences the effectiveness of online advertising. We find that matching an ad to website content and increasing an ad's obtrusiveness independently increase purchase intent. However, in ...
Designing online banner advertisements: should we animate?
CHI '02: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems

A common medium for advertising on the Internet is the use of banner ads. This study investigates recall and recognition of animated banner advertisements in an attempt to identify design guidelines. It was hypothesized that animation would increase ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 10, Issue 12

Dec. 1967

64 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/363848

Editor:
Gerard Salton
Cornell Univ., Ithaca, NY

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1967

Published in CACM Volume 10, Issue 12

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

59
Total Citations
View Citations
1,218
Total Downloads

Downloads (Last 12 months)271
Downloads (Last 6 weeks)25

Reflects downloads up to 17 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ulus DFerrère TAsarin ENickovic DMaler O(2024)Elements of Timed Pattern MatchingACM Transactions on Embedded Computing Systems10.1145/364511423:4(1-45)Online publication date: 10-Feb-2024
https://dl.acm.org/doi/10.1145/3645114
Ritchie DThompson K(2022)The Unix Time-Sharing SystemClassic Operating Systems10.1007/978-1-4757-3510-9_11(195-220)Online publication date: 3-Aug-2022
https://doi.org/10.1007/978-1-4757-3510-9_11
Anzt HCojean TYen-Chen CDongarra JFlegar GNayak PTomov STsai YWang W(2020)Load-balancing Sparse Matrix Vector Product Kernels on GPUsACM Transactions on Parallel Computing10.1145/33809307:1(1-26)Online publication date: 29-Mar-2020
https://dl.acm.org/doi/10.1145/3380930
Viola E(2019)Guest ColumnACM SIGACT News10.1145/3364626.336463750:3(52-74)Online publication date: 24-Sep-2019
https://dl.acm.org/doi/10.1145/3364626.3364637
Shimi A(2019)The Splendors and Miseries of RoundsACM SIGACT News10.1145/3364626.336463550:3(35-50)Online publication date: 24-Sep-2019
https://dl.acm.org/doi/10.1145/3364626.3364635
Moshkovitz D(2019)Sliding Scale Conjectures in PCPACM SIGACT News10.1145/3364626.336463250:3(25-33)Online publication date: 24-Sep-2019
https://dl.acm.org/doi/10.1145/3364626.3364632
O’Donnell RWu YZhou Y(2014)Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)ACM Transactions on Computation Theory10.1145/25782216:1(1-13)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1145/2578221
Ada AChattopadhyay ACook SFontes LKoucký MPitassi T(2014)The Hardness of Being PrivateACM Transactions on Computation Theory10.1145/25676716:1(1-24)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1145/2567671
Chen TDiciolla MKwiatkowska MMereacre A(2013)Verification of linear duration properties over continuous-time markov chainsACM Transactions on Computational Logic10.1145/252893514:4(1-35)Online publication date: 28-Nov-2013
https://dl.acm.org/doi/10.1145/2528935
Danvy OZerny I(2013)Three syntactic theories for combinatory graph reductionACM Transactions on Computational Logic10.1145/252893214:4(1-27)Online publication date: 28-Nov-2013
https://dl.acm.org/doi/10.1145/2528932
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Online Advertising: Experimental Facts on Ethics, Involvement, and Product Type

Online Display Advertising: Targeting and Obtrusiveness

Designing online banner advertisements: should we animate?

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations