Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-00596-1_32
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Realisability Semantics of Parametric Polymorphism, General References and Recursive Types

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2010English

Semantics and Types of Cough

Pulmonary Pharmacology and Therapeutics
BiochemistryMedicinePulmonaryRespiratory MedicinePharmacology
2009English

Recursive Equivalence Types and Octahedra

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1983English

Realizability of Schedules by Stochastic Time Petri Nets With Blocking Semantics

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

The Recursive Record Semantics of Objects Revisited

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

General Semantics

Science
MultidisciplinaryPhilosophy of ScienceHistory
1958English

Semantics and Complexity of Recursive Aggregates in Answer Set Programming

Artificial Intelligence
LinguisticsLanguageArtificial Intelligence
2011English

Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

The Parametric Ordinal-Recursive Complexity of Post Embedding Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy