I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Axiomatic definability and completeness for recursive progr..:
, In:
Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
,
Meyer, Albert R.
;
Mitchell, John C.
- p. 337-346 , 1982
Link:
https://dl.acm.org/doi/10.1145/582153.582188
RT T1 <cTitle>Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages</cTitle>: T1 <Title>Axiomatic definability and completeness for recursive programs</Title> UL https://suche.suub.uni-bremen.de/peid=acm-582188&Exemplar=1&LAN=DE A1 Meyer, Albert R. A1 Mitchell, John C. PB ACM YR 1982 K1 Theory of computation K1 Logic SP 337 OP 346 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/582153.582188 DO https://dl.acm.org/doi/10.1145/582153.582188 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
