top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Category Theory and Computer Science [[electronic resource] ] : 6th International Conference, CTCS '95, Cambridge, United Kingdom, August 7 - 11, 1995. Proceedings / / edited by David Pitt, David E. Rydeheard, Peter Johnstone
Category Theory and Computer Science [[electronic resource] ] : 6th International Conference, CTCS '95, Cambridge, United Kingdom, August 7 - 11, 1995. Proceedings / / edited by David Pitt, David E. Rydeheard, Peter Johnstone
Edizione [1st ed. 1995.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995
Descrizione fisica 1 online resource (IX, 259 p.)
Disciplina 005.13/1
Collana Lecture Notes in Computer Science
Soggetto topico Computer science—Mathematics
Computer logic
Mathematical logic
Software engineering
Programming languages (Electronic computers)
K-theory
Mathematics of Computing
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Software Engineering
Programming Languages, Compilers, Interpreters
K-Theory
ISBN 3-540-44661-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Control structures: A model of interaction -- Convenient category of processes and simulations I: Modulo strong bisimilarity -- Dualities between nets and automata induced by schizophrenic objects -- Relational set theory -- Proof of a S.Mac Lane conjecture (extended abstract) -- Effective applicative structures -- The S-replete construction -- The convex powerdomain in a category of posets realized by cpos -- Lifting as a KZ-doctrine -- Categorical fixed point calculus -- A category-theoretic treatment of a parallel algol-like language -- Categorical reconstruction of a reduction free normalization proof -- Decomposing typed lambda calculus into a couple of categorical programming languages -- V-comprehensions and P space -- A proposed categorical semantics for ML modules.
Record Nr. UNISA-996466139103316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Category Theory and Computer Science [[electronic resource] ] : Paris, France, September 3-6, 1991. Proceedings / / edited by David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew Pitts, Axel Poigne, David E. Rydeheard
Category Theory and Computer Science [[electronic resource] ] : Paris, France, September 3-6, 1991. Proceedings / / edited by David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew Pitts, Axel Poigne, David E. Rydeheard
Edizione [1st ed. 1991.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991
Descrizione fisica 1 online resource (VIII, 304 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Mathematics
Computers
Computer logic
Mathematical logic
Programming languages (Electronic computers)
Software engineering
Mathematics, general
Theory of Computation
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Programming Languages, Compilers, Interpreters
Software Engineering
ISBN 3-540-38413-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Stone duality for stable functions -- Bifinite domains: Stable case -- Local variables and non-interference in algol-like languages -- Categories of information systems -- Collapsing graph models by preorders -- Linear logic and interference control -- Higher dimensional word problem -- BCK-formulas having unique proofs -- Proof nets and coherence theorems -- A modular approach to denotational semantics -- Programs in partial algebras — A categorical approach -- Tail recursion from universal invariants -- A direct proof of the intuitionistic Ramsey Theorem -- Constructions and predicates -- Relating models of impredicative type theories -- Two results on set-theoretic polymorphism -- An algebra of graphs and graph rewriting -- Dataflow networks are fibrations -- Applications of the calculus of trees to process description languages.
Record Nr. UNISA-996465660003316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Category Theory and Computer Science [[electronic resource] ] : Manchester, UK, September 5-8, 1989. Proceedings / / edited by David H. Pitt, David E. Rydeheard, Peter Dybjer, Andrew Pitts, Axel Poigne
Category Theory and Computer Science [[electronic resource] ] : Manchester, UK, September 5-8, 1989. Proceedings / / edited by David H. Pitt, David E. Rydeheard, Peter Dybjer, Andrew Pitts, Axel Poigne
Edizione [1st ed. 1989.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989
Descrizione fisica 1 online resource (VIII, 372 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Software engineering
Computer logic
Mathematical logic
Programming languages (Electronic computers)
Software Engineering
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Programming Languages, Compilers, Interpreters
Mathematical Logic and Foundations
ISBN 3-540-46740-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Coherence and valid isomorphism in closed categories applications of proof theory to category theory in a computer sclentist perspective -- An algebraic view of interleaving and distributed operational semantics for CCS -- Temporal structures -- Compositional relational semantics for indeterminate dataflow networks -- Operations on records -- Projections for polymorphic strictness analysis -- A category-theoretic account of program modules -- A note on categorical datatypes -- A set constructor for inductive sets in Martin-Löf's type theory -- Independence results for calculi of dependent types -- Quantitative domains, groupoids and linear logic -- Graded multicategories of polynomial-time realizers -- On the semantics of second order lambda calculus: From bruce-meyer-mitchell models to hyperdoctrine models and vice-versa -- Dictoses -- Declarative continuations: An investigation of duality in programming language semantics -- Logic representation in LF -- Unification properties of commutative theories: A categorical treatment -- An abstract formulation for rewrite systems -- From petri nets to linear logic -- A dialectica-like model of linear logic -- A final coalgebra theorem.
Record Nr. UNISA-996465729003316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Category Theory and Computer Science [[electronic resource] ] : Edinburgh, UK, September 7-9, 1987. Proceedings / / edited by David H. Pitt, Axel Poigne, David E. Rydeheard
Category Theory and Computer Science [[electronic resource] ] : Edinburgh, UK, September 7-9, 1987. Proceedings / / edited by David H. Pitt, Axel Poigne, David E. Rydeheard
Edizione [1st ed. 1987.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987
Descrizione fisica 1 online resource (VIII, 304 p.)
Disciplina 514
Collana Lecture Notes in Computer Science
Soggetto topico Topology
Computer logic
Mathematical logic
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Mathematical Logic and Foundations
ISBN 3-540-48006-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Categories and effective computations -- Polymorphism is set theoretic, constructively -- An equational presentation of higher order logic -- Enriched categories for local and interaction calculi -- The category of Milner processes is exact -- Relating two models of hardware -- Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms -- A typed lambda calculus with categorical type constructors -- Final algebras, cosemicomputable algebras, and degrees of unsolvability -- Good functors ... are those preserving philosophy! -- Viewing implementations as an institution -- An interval model for second order lambda calculus -- Logical aspects of denotational semantics -- Connections between partial maps categories and tripos theory -- A fixpoint construction of the p-adic domain -- A category of Galois connections.
Record Nr. UNISA-996465797603316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui