![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 92 matches
- 1985
- Miren Begoña Albizuri-Romero:
Internal representation of programs in GRASE. ACM SIGPLAN Notices 20(8): 41-50 (1985) - Edward G. Amoroso:
The formal specification and prototype implementation of a simple editor. ACM SIGPLAN Notices 20(8): 51-59 (1985) - Roger R. Baldwin:
A generalization of Neta Amit's statement of the general problem of deeply nested IF-THEN-ELSEs. ACM SIGPLAN Notices 20(10): 9-13 (1985) - Michael P. Barnett:
The primitive string manipulation (PRISM) language. ACM SIGPLAN Notices 20(9): 11-20 (1985) - Michael P. Barnett:
A simple mechanism that supports the prism language. ACM SIGPLAN Notices 20(12): 5-12 (1985) - Richard Bielak:
ADA(*) vs. Modula-2: a view from the trenches. ACM SIGPLAN Notices 20(12): 13-17 (1985) - Carl Binding:
Cheap concurrency in C. ACM SIGPLAN Notices 20(9): 21-26 (1985) - Graham M. Birtwistle:
The coroutines of Hanoi. ACM SIGPLAN Notices 20(1): 9-10 (1985) - Pierre Breguet, François Grize, Alfred Strohmeier:
SARTEX a programming language for graph processing. ACM SIGPLAN Notices 20(1): 11-19 (1985) - Coenraad Bron, E. J. Dijkstra, T. J. Rossingh:
A note on the checking of interfaces between separately compiled modules. ACM SIGPLAN Notices 20(8): 60-63 (1985) - G. Brun, Arnold Businger, Roger Schoenberger:
The token-oriented approach to program editing. ACM SIGPLAN Notices 20(2): 17-20 (1985) - Peter A. Buhr:
A case for teaching multi-exit loops to beginning programmers. ACM SIGPLAN Notices 20(11): 14-22 (1985) - Neil A. Burkhard:
Machine-independent C optimizer. ACM SIGPLAN Notices 20(11): 23-26 (1985) - A. P. Chang:
A note on the MODULO operation. ACM SIGPLAN Notices 20(4): 19-23 (1985) - A. Toni Cohen, Thomas J. Myers:
Information sharing. ACM SIGPLAN Notices 20(9): 27-31 (1985) - Ian D. Cottam:
Extending Pascal with one-entry/multi-exit procedures. ACM SIGPLAN Notices 20(2): 21-31 (1985) - Michael A. Covington:
Eliminating unwanted loops in Prolog. ACM SIGPLAN Notices 20(1): 20-26 (1985) - Michael A. Covington:
A further note on looping in Prolog. ACM SIGPLAN Notices 20(8): 28-31 (1985) - Albert L. Crawford:
High level input/output in Modula-2. ACM SIGPLAN Notices 20(12): 18-25 (1985) - Malcolm K. Crowe
, Clark Nicol, Michael Hughes, David Mackay:
On converting a compiler into an incremental compiler. ACM SIGPLAN Notices 20(10): 14-22 (1985) - Jurek Czyzowicz, Michal Iglewski:
Implementing generic types in Modula-2. ACM SIGPLAN Notices 20(12): 26-32 (1985) - Michael R. Dunlavey:
A progress report on D: a compiled language featuring continuations. ACM SIGPLAN Notices 20(5): 8-15 (1985) - Kalyan Dutta:
Modular programming in C: an approach and an example. ACM SIGPLAN Notices 20(3): 9-15 (1985) - Barry Dwyer:
Improving Gough's LL(1) lookahead generator. ACM SIGPLAN Notices 20(11): 27-29 (1985) - Bleicke Eggers:
The towers of Hanoi: yet another nonrecursive solution. ACM SIGPLAN Notices 20(9): 32-42 (1985) - Lem O. Ejiogu:
A simple measure of software complexity. ACM SIGPLAN Notices 20(3): 16-31 (1985) - A. J. Gerber:
The trouble with mutual recursion in Concurrent Euclid. ACM SIGPLAN Notices 20(8): 64-70 (1985) - Harvey Glass:
Threaded interpretive systems and functional programming environments. ACM SIGPLAN Notices 20(4): 24-32 (1985) - Morton Goldberg:
A response to "some concerns about Modula-2". ACM SIGPLAN Notices 20(8): 71-72 (1985) - K. John Gough:
A new method of generating LL(1) lookahead sets. ACM SIGPLAN Notices 20(6): 16-19 (1985)
skipping 62 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-05 18:55 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint