ACM Home Page
Please provide us with feedback. Feedback
Interpreting ABF—a language for document construction
Full text PdfPdf (683 KB)
Source Conference on Programming Language Design and Implementation archive
Papers of the Symposium on Interpreters and interpretive techniques table of contents
St. Paul, Minnesota, United States
Pages: 205 - 213  
Year of Publication: 1987
ISBN:0-89791-235-7
Also published in ...
Authors
H. Harr  De Paul University, Chicago, IL
M. W. Evens  IIT/Chicago-Kent College of Law, Chicago, IL
J. Sprowl  IIT/Chicago-Kent College of Law, Chicago, IL
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 16,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/29650.29672
What is a DOI?

ABSTRACT

This paper describes an interpreter for ABF, a language for constructing legal documents. The ABF language defines both commands to develop documents and commands to manipulate those documents. The language has typical programming constructs for sequence, selection, and repetition but also allows the user other capabilities to aid in document construction; the user can modify the program while it is running (change the document while it is being processed), type the variables during the initial processing of a document, and then change the type during later processing, enter commands that require a change of context during the processing of a document, output a document with variables still undefined. A document is constructed using conditional and repeat statements and incorporation of other documents by reference. Data types include documents, strings, numbers, dollar amounts and logical values. Arrays can be formed for all types except documents. There are three forms of subprograms: documents can be incorporated by reference in other documents at any point at which a variable name is permitted; rules (subprocedures) for computing values can be attached to any variable; and alternate questions can be attached to variables in a similar manner. The ABF system queries the user for any values needed to complete a document; questions are generated from variable names.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Harr, Henry. 1987. Automatic Compilation of Legal Documents. Unpublished Ph.D. Dissertation, Computer Science Department, Illinois Institute of Technology.
 
4
Krasner, Glenn. 1983. Smalltalk-80. Addison-Wesley, Reading, Massachusetts.
 
5
Sprowl, J. A. 1979. "Automating the Legal Reasoning Process: A Computer That Uses Regulations and Statues to Draft Legal Documents." American Bar Foundation Research Journal. Vol. 1979, 1-8.
 
6
Sprowl, J. A., Balasubramanian, P., Chinwalla, T., Evens, M., and Klawans, H. 1984. "An Expert System for Drafting Legal Documents." Proceedings of the National Computer Conference , Las Vegas, AFIPS, 667-673.
 
7

Collaborative Colleagues:
H. Harr: colleagues
M. W. Evens: colleagues
J. Sprowl: colleagues