Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    b3kat_BV036033688
    Format: 1 Online-Ressource (VII,478 S. , graph.Darst.)
    ISBN: 3540106995 , 0387106995
    Series Statement: Lecture notes in computer science 107
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Programmierung ; Konferenzschrift ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Author information: Díaz, Josep 1950-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almafu_BV001997348
    Format: VII,478 S. : graph.Darst.
    ISBN: 3-540-10699-5 , 0-387-10699-5
    Series Statement: Lecture notes in computer science 107
    Language: French
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Programmierung ; Konferenzschrift ; Konferenzschrift
    Author information: Díaz, Josep 1950-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almafu_9959186247102883
    Format: 1 online resource (X, 486 p.)
    Edition: 1st ed. 1981.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-38654-8
    Series Statement: Lecture Notes in Computer Science, 107
    Note: Bibliographic Level Mode of Issuance: Monograph , The algebra of functional programs: Function level reasoning, linear equations, and extended definitions -- The VDM principles of software specification & program design -- Attribute grammars : Theory and applications -- Compiler generation from formal definition of programming languages : A survey -- Formal behavioural specification of concurrent systems without globality assumptions -- A birkhoff-like theorem for algebraic classes of interpretations of program schemes -- Building data base management systems through formal specification -- Reducing types in applicative languages with structured data -- On the definition of lambda-calculus models -- About data type genericity -- On the algebraic extensions of abstract data types -- Scenarios: A model of non-determinate computation -- An operational semantics for a language with early completion data structures -- Le calcul des fermetures dans les lambda-langages -- Distributed termination with interval assertions -- Algebraic denotational semantics using parameterized abstract modules -- Relational semantics of strongly communicating sequential processes -- A construction of concurrent systems by means of sequential solutions and concurrency relations -- The development of an interpreter by means of abstract algebraic software specifications -- A formal model of an interpreter for nonprocedural languages -- Proof theoretic methodology for propositional dynamic logic -- FP systems in edinburgh LCF -- A proposal for operational semantics and equivalence of finite asynchronous processes -- An extension to horn clause logic allowing the definition of concurrent processes -- A semantic algebra for binding constructs -- On the representation of data types -- An approach to communications and parallelism in applicative languages -- Using least fixed points to characterize formal computations of non-deterministic equations -- Formal representations for recursively defined functional programs -- Petri nets and concurrency-like relations. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-10699-5
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    almahu_9947920852102882
    Format: X, 486 p. , online resource.
    ISBN: 9783540386544
    Series Statement: Lecture Notes in Computer Science, 107
    Note: The algebra of functional programs: Function level reasoning, linear equations, and extended definitions -- The VDM principles of software specification & program design -- Attribute grammars : Theory and applications -- Compiler generation from formal definition of programming languages : A survey -- Formal behavioural specification of concurrent systems without globality assumptions -- A birkhoff-like theorem for algebraic classes of interpretations of program schemes -- Building data base management systems through formal specification -- Reducing types in applicative languages with structured data -- On the definition of lambda-calculus models -- About data type genericity -- On the algebraic extensions of abstract data types -- Scenarios: A model of non-determinate computation -- An operational semantics for a language with early completion data structures -- Le calcul des fermetures dans les lambda-langages -- Distributed termination with interval assertions -- Algebraic denotational semantics using parameterized abstract modules -- Relational semantics of strongly communicating sequential processes -- A construction of concurrent systems by means of sequential solutions and concurrency relations -- The development of an interpreter by means of abstract algebraic software specifications -- A formal model of an interpreter for nonprocedural languages -- Proof theoretic methodology for propositional dynamic logic -- FP systems in edinburgh LCF -- A proposal for operational semantics and equivalence of finite asynchronous processes -- An extension to horn clause logic allowing the definition of concurrent processes -- A semantic algebra for binding constructs -- On the representation of data types -- An approach to communications and parallelism in applicative languages -- Using least fixed points to characterize formal computations of non-deterministic equations -- Formal representations for recursively defined functional programs -- Petri nets and concurrency-like relations.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540106999
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    almahu_9948621597202882
    Format: X, 486 p. , online resource.
    Edition: 1st ed. 1981.
    ISBN: 9783540386544
    Series Statement: Lecture Notes in Computer Science, 107
    Note: The algebra of functional programs: Function level reasoning, linear equations, and extended definitions -- The VDM principles of software specification & program design -- Attribute grammars : Theory and applications -- Compiler generation from formal definition of programming languages : A survey -- Formal behavioural specification of concurrent systems without globality assumptions -- A birkhoff-like theorem for algebraic classes of interpretations of program schemes -- Building data base management systems through formal specification -- Reducing types in applicative languages with structured data -- On the definition of lambda-calculus models -- About data type genericity -- On the algebraic extensions of abstract data types -- Scenarios: A model of non-determinate computation -- An operational semantics for a language with early completion data structures -- Le calcul des fermetures dans les lambda-langages -- Distributed termination with interval assertions -- Algebraic denotational semantics using parameterized abstract modules -- Relational semantics of strongly communicating sequential processes -- A construction of concurrent systems by means of sequential solutions and concurrency relations -- The development of an interpreter by means of abstract algebraic software specifications -- A formal model of an interpreter for nonprocedural languages -- Proof theoretic methodology for propositional dynamic logic -- FP systems in edinburgh LCF -- A proposal for operational semantics and equivalence of finite asynchronous processes -- An extension to horn clause logic allowing the definition of concurrent processes -- A semantic algebra for binding constructs -- On the representation of data types -- An approach to communications and parallelism in applicative languages -- Using least fixed points to characterize formal computations of non-deterministic equations -- Formal representations for recursively defined functional programs -- Petri nets and concurrency-like relations.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662195109
    Additional Edition: Printed edition: ISBN 9783540106999
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Berlin, Heidelberg : Springer Berlin Heidelberg
    UID:
    gbv_164919840X
    Format: Online-Ressource
    ISBN: 9783540386544
    Series Statement: Lecture Notes in Computer Science 107
    Additional Edition: ISBN 9783540106999
    Additional Edition: Buchausg. u.d.T. Formalization of programming concepts Berlin [u.a.] : Springer, 1981 ISBN 3540106995
    Additional Edition: ISBN 0387106995
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Programmierung ; Konferenzschrift
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    b3kat_BV001997348
    Format: VII,478 S. , graph.Darst.
    ISBN: 3540106995 , 0387106995
    Series Statement: Lecture notes in computer science 107
    Language: French
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Programmierung ; Konferenzschrift
    Author information: Díaz, Josep 1950-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    edocfu_9959186247102883
    Format: 1 online resource (X, 486 p.)
    Edition: 1st ed. 1981.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-38654-8
    Series Statement: Lecture Notes in Computer Science, 107
    Note: Bibliographic Level Mode of Issuance: Monograph , The algebra of functional programs: Function level reasoning, linear equations, and extended definitions -- The VDM principles of software specification & program design -- Attribute grammars : Theory and applications -- Compiler generation from formal definition of programming languages : A survey -- Formal behavioural specification of concurrent systems without globality assumptions -- A birkhoff-like theorem for algebraic classes of interpretations of program schemes -- Building data base management systems through formal specification -- Reducing types in applicative languages with structured data -- On the definition of lambda-calculus models -- About data type genericity -- On the algebraic extensions of abstract data types -- Scenarios: A model of non-determinate computation -- An operational semantics for a language with early completion data structures -- Le calcul des fermetures dans les lambda-langages -- Distributed termination with interval assertions -- Algebraic denotational semantics using parameterized abstract modules -- Relational semantics of strongly communicating sequential processes -- A construction of concurrent systems by means of sequential solutions and concurrency relations -- The development of an interpreter by means of abstract algebraic software specifications -- A formal model of an interpreter for nonprocedural languages -- Proof theoretic methodology for propositional dynamic logic -- FP systems in edinburgh LCF -- A proposal for operational semantics and equivalence of finite asynchronous processes -- An extension to horn clause logic allowing the definition of concurrent processes -- A semantic algebra for binding constructs -- On the representation of data types -- An approach to communications and parallelism in applicative languages -- Using least fixed points to characterize formal computations of non-deterministic equations -- Formal representations for recursively defined functional programs -- Petri nets and concurrency-like relations. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-10699-5
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    edoccha_9959186247102883
    Format: 1 online resource (X, 486 p.)
    Edition: 1st ed. 1981.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-38654-8
    Series Statement: Lecture Notes in Computer Science, 107
    Note: Bibliographic Level Mode of Issuance: Monograph , The algebra of functional programs: Function level reasoning, linear equations, and extended definitions -- The VDM principles of software specification & program design -- Attribute grammars : Theory and applications -- Compiler generation from formal definition of programming languages : A survey -- Formal behavioural specification of concurrent systems without globality assumptions -- A birkhoff-like theorem for algebraic classes of interpretations of program schemes -- Building data base management systems through formal specification -- Reducing types in applicative languages with structured data -- On the definition of lambda-calculus models -- About data type genericity -- On the algebraic extensions of abstract data types -- Scenarios: A model of non-determinate computation -- An operational semantics for a language with early completion data structures -- Le calcul des fermetures dans les lambda-langages -- Distributed termination with interval assertions -- Algebraic denotational semantics using parameterized abstract modules -- Relational semantics of strongly communicating sequential processes -- A construction of concurrent systems by means of sequential solutions and concurrency relations -- The development of an interpreter by means of abstract algebraic software specifications -- A formal model of an interpreter for nonprocedural languages -- Proof theoretic methodology for propositional dynamic logic -- FP systems in edinburgh LCF -- A proposal for operational semantics and equivalence of finite asynchronous processes -- An extension to horn clause logic allowing the definition of concurrent processes -- A semantic algebra for binding constructs -- On the representation of data types -- An approach to communications and parallelism in applicative languages -- Using least fixed points to characterize formal computations of non-deterministic equations -- Formal representations for recursively defined functional programs -- Petri nets and concurrency-like relations. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-10699-5
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    UID:
    gbv_023861800
    Format: VII, 478 S. , graph. Darst.
    ISBN: 3540106995 , 0387106995
    Series Statement: Lecture notes in computer science 107
    Note: Literaturangaben
    Additional Edition: Online-Ausg. Formalization of programming concepts Berlin [u.a.] : Springer, 1981 ISBN 9783540386544
    Additional Edition: Erscheint auch als Online-Ausgabe Diaz, J. Formalization of Programming Concepts Berlin, Heidelberg : Springer Berlin Heidelberg, 1981 ISBN 9783540386544
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Programmierung ; Konferenzschrift ; Konferenzschrift
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783401069999?
Did you mean 9783440116999?
Did you mean 9783540103899?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages