Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the complexity of some problems concerning the use of procedures. II

From MaRDI portal
Publication:1169277
Jump to:navigation, search

DOI10.1007/BF00289578zbMath0494.68008OpenAlexW4232260294MaRDI QIDQ1169277

Karl Winklmann

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289578

zbMATH Keywords

programming languagesdecidabilityproceduresformal parameter correctnessformal recursivity


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)


Related Items

A polynomial determination of the most-recent property in Pascal-like programs, Complete problems for space bounded subclasses of NP



Cites Work

  • The formal termination problem for programs with finite ALGOL 68-modes
  • On the complexity of some problems concerning the use of procedures. I
  • On procedures as open subroutines. II
  • On correct procedure parameter transmission in higher programming languages
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1169277&oldid=13234821"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki