Realist Consequence, Epistemic Inference, Computational Correctness

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Unknown venue

• Publication date

  2015-05-19

• Fields of study

  Philosophy, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-15368-1_26
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Philosophy of Computer Science

  2014cited by this paper
• A Taxonomy of Errors for Information Systems

  2013cited by this paper
• Lectures on the Curry-Howard Isomorphism

  2013cited by this paper
• A Multi-Modal Dependent Type Theory for Representing Data Accessibility in a Network

  2013cited by this paper
• Lambda Calculus with Types

  2013cited by this paper
• A Double Diamond of Judgement

  2012cited by this paper
• College Of Science And Engineering

  2010cited by this paper
• Explaining Computation Without Semantics: Keeping it Simple

  2010cited by this paper
• Constructive contextual modal judgments for reasoning from open assumptions

  2010cited by this paper
• Proceeding in Abstraction. From Concepts to Types and the Recent Perspective on Information

  2009cited by this paper
• Contextual modal type theory

  2008cited by this paper
• An epistemic constructive definition of information

  2007cited by this paper
• Abstraction in Computer Science

  2007cited by this paper
• Type-Safe Distributed Programming with ML5

  2007cited by this paper
• Turing, Computing and Communication

  2006cited by this paper
• A Modal Language for the Safety of Mobile Values

  2006cited by this paper
• Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)

  2006cited by this paper
• Modal Types for Mobile Code (Thesis Proposal) ∗

  2006cited by this paper
• Philosophy of Computer Science: An Introductory Course

  2005cited by this paper
• Logic, Epistemology, and the Unity of Science

  2004cited by this paper
• Super-Recursive Algorithms (Monographs in Computer Science)

  2004cited by this paper
• Modal Proofs as Distributed Programs (Extended Abstract)

  2004cited by this paper
• Super-Recursive Algorithms

  2004cited by this paper
• A symmetric modal lambda calculus for distributed computing

  2004cited by this paper
• Types and programming languages: the next generation

  2003cited by this paper
• Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

  2002cited by this paper
• Categorical and Kripke Semantics for Constructive S4 Modal Logic

  2001cited by this paper
• A judgmental reconstruction of modal logic

  2001cited by this paper
• A modal analysis of staged computation

  2001cited by this paper
• A Constructive Logic for Services and Information Flow in Computer Networks

  2000cited by this paper
• On an Intuitionistic Modal Logic

  2000cited by this paper
• Anytime, anywhere: modal logics for mobile ambients

  2000cited by this paper
• Inhabitation in Typed Lambda-Calculi (A Syntactic Approach)

  1997cited by this paper
• The Broad Conception of Computation

  1997cited by this paper
• Why interaction is more powerful than algorithms

  1997cited by this paper
• A simple proof of the undecidability of inhabitation in λP

  1996cited by this paper
• Limits of Correctness in Computers

  1996influential reference
• An Algorithm for Type-Checking Dependent Types

  1996cited by this paper
• Subtyping dependent types

  1996cited by this paper
• The semantics of types in programming languages

  1995cited by this paper
• Inhabitation of Types in the Simply Typed Lambda Calculus

  1995cited by this paper
• The proof theory and semantics of intuitionistic modal logic

  1994cited by this paper
• Lazy Theories of Operations and Types

  1993cited by this paper
• Type theory and functional programming

  1991cited by this paper
• Programming in Martin-Lo¨f's type theory: an introduction

  1990cited by this paper
• Typechecking Dependent Types and Subtypes

  1986cited by this paper
• Proceedings of the Workshop on Foundations of Logic and Functional Programming

  1986cited by this paper
• The Lambda Calculus: Its Syntax and Semantics

  1985cited by this paper
• Social processes and proofs of theorems and programs

  1979cited by this paper
• Zur Deutung der intuitionistischen Logik

  1932cited by this paper

• A logic of efficient and optimal designs

  2019cites this paper
• A Logic of E(cid:30)cient and Optimal Designs

  2019cites this paper
• Validity and Correctness Before the OS: the Case of LEO I and LEO II

  2018cites this paper
• Algorithmic Iteration for Computational Intelligence

  2017cites this paper