article

Free access

Generic instantiations as closures

Author:

F. HoschAuthors Info & Claims

ACM SIGAda Ada Letters, Volume X, Issue 1

Pages 122 - 130

https://doi.org/10.1145/101139.101281

Published: 01 January 1990 Publication History

PDF eReader

References

[1]

[1] H. Boehm, A. Demers, and J. Donahue, "A Programmer's Introduction to Russell," Rice University Department of Computer Science Technical Report COMP TR 85-16, 1985 (distributed with the Russell compiler, [email protected]).

Google Scholar

[2]

[2] J. Donahue and A. Demers, "Data types are value," ACM Transactions on Programming Languages and Systems, Vol. 7, No. 3, July 1985.

Digital Library

Google Scholar

[3]

[3] R. Harper, D. MacQueen, and R. Milner, "Standard ML," Report ECS-LFCS-86-2, Edinburgh University Computer Science Dept., 1986.

Google Scholar

[4]

[4] R. Harper, R. Milner, and M. Tofte, "The definition of Standard ML, version 2," Report ECS-LFCS-88-62, Edinburgh University Computer Science Dept., 1988.

Digital Library

Google Scholar

[5]

[5] M. J. C. Gordon, The Denotational Description of Programming Languages, Springer-Verlag, New York, 1979.

Digital Library

Google Scholar

[6]

[6] J. C. Reynolds, "Towards a theory of type structure," Proc. Colloque sur la Programmation, Lecture Notes in Computer Science 19, Springer-Verlag, New York, 1974.

Digital Library

Google Scholar

[7]

[7] R. D. Tennent, "On a new approach to representation independent data classes", Acta Inform . 8, 1977.

Google Scholar

[8]

[8] R. D. Tennent, Principles of Programming Languages, Prentice-Hall, 1981.

Digital Library

Google Scholar

[9]

[9] D. A. Turner, "Miranda: a non-strict functional language with polymorphic types," Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science 201, Springer-Verlag, Berlin, 1985.

Digital Library

Google Scholar

Cited By

View all

Baker H(1991)Structured programming with limited private types in AdaACM SIGAda Ada Letters10.1145/122215.122219XI:5(79-90)Online publication date: 1-Aug-1991
https://dl.acm.org/doi/10.1145/122215.122219

Index Terms

Generic instantiations as closures
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Operational analysis
  2. Software notations and tools
    1. General programming languages
      1. Language features
      2. Language types
        Functional languages
2. Theory of computation
  1. Formal languages and automata theory
  2. Semantics and reasoning
    1. Program semantics
      1. Operational semantics

Recommendations

Puncturable Signature: A Generic Construction and Instantiations
Computer Security – ESORICS 2022
Abstract
Puncturable signature (PS), proposed by Bellare, Stepanovs and Waters at EUROCRYPT 2016, is a special kind of digital signature that supports a fine-grained revocation of signing capacity by updating the secret key with selective messages. ...
L-fuzzy interiors and L-fuzzy closures

In this paper, we introduce new definitions of L-fuzzy neighborhood systems, L-fuzzy interior operators and L-fuzzy closure operators. Three characterizations of the category L-FTOP of L-fuzzy topological spaces and their L-fuzzy continuous mappings are ...
Gorenstein Fano generic torus orbit closures in $G / P$
Abstract
Given a reductive group G and a parabolic subgroup $P \subset G$ , with maximal torus T, we consider (following Dabrowski’s work) the closure X of a generic T-orbit in G/P and determine in combinatorial terms when the toric variety X is $Q$ -Gorenstein Fano, ...

Comments

Information & Contributors

Information

Published In

ACM SIGAda Ada Letters Volume X, Issue 1

Jan./Feb. 1990

77 pages

ISSN:1094-3641

DOI:10.1145/101139

Editor:
Geoff Mendal
Stanford Univ., Stanford, CA

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1990

Published in SIGADA Volume X, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
83
Total Downloads

Downloads (Last 12 months)15
Downloads (Last 6 weeks)6

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Baker H(1991)Structured programming with limited private types in AdaACM SIGAda Ada Letters10.1145/122215.122219XI:5(79-90)Online publication date: 1-Aug-1991
https://dl.acm.org/doi/10.1145/122215.122219

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

References

Cited By

Index Terms

Recommendations

Puncturable Signature: A Generic Construction and Instantiations

L-fuzzy interiors and L-fuzzy closures

Gorenstein Fano generic torus orbit closures in G/P

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations

Gorenstein Fano generic torus orbit closures in $G / P$