Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
branch: master
Fetching contributors…

Cannot retrieve contributors at this time

206 lines (143 sloc) 9.71 kb
<!DOCTYPE html>
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
<meta name="readability-verification" content="cG3MqZcEVveKZ6mnEFkePAL3Ug79Jxxp5Fn27CM7" />
<title>JS ⊢ Jon Sterling</title>
<link rel="stylesheet" type="text/css" href="./css/screen.css" />
<link rel="stylesheet" type="text/css" href="./css/syntax.css" />
<link rel="stylesheet" type="text/css" href="./css/coqdoc.css" />
<style type="text/css">
@import url(http://nmashton.ca/css/gloss-0.0.1.css);
</style>
<script type="text/javascript" src="http://code.jquery.com/jquery-1.8.3.min.js"></script>
<script type="text/javascript" src="http://nmashton.ca/js/gloss-0.0.1.js"></script>
<link rel="alternate" type="application/rss+xml" title="Jonathan Sterling" href="./rss.xml" />
<!--[if IE]>
<script src="http://html5shiv.googlecode.com/svn/trunk/html5.js"></script><![endif]-->
<!--[if lte IE 7]>
<script src="js/IE8.js" type="text/javascript"></script><![endif]-->
<!--[if lt IE 7]>
<link rel="stylesheet" type="text/css" media="all" href="css/ie6.css"/><![endif]-->
<script type="text/javascript" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
MathJax.Hub.Config({
showMathMenu: false,
showProcessingMessages: false,
messageStyle: "none",
'HTML-CSS': {
availableFonts: [],
webFont: 'TeX',
},
TeX: {
Macros: {
gk: ["\\style{font-family:Junicode!important; font-size:1.3em;}{\\text{#1}}", 1]
}
}
});
</script>
</head>
<body>
<header>
<h1><a href="./index.html"><span class="title">Jon Sterling.</span></a></h1>
</header>
<section id="about">
<p>Software engineer, dilettante type theorist, syntactician, and philologist. Student of Ancient Greek, Sumerian, Hittite, Akkadian, Latin, Old English and German. I also co-host <a href="http://typetheorypodcast.com/">The Type Theory Podcast</a>.</p>
<ul class="links">
<li><a href="./archive.html">Archives</a></li>
<li><a href="./talks.html">Talks</a></li>
<li><a href="./papers.html">Papers</a></li>
</ul>
</section>
<section>
<article class="digest">
<h3>
<a href="./posts/2014-11-22-computational-type-theories-as-refinement-systems.html">Computational Type Theories as Refinement Systems</a>
<span class="date">November 22, 2014</span>
</h3>
<p>The intrinsic and extrinsic views on types are unified by considering two categories: one of <em>syntactic</em> types and terms, and another of <em>semantic</em> types and derivations, and then a forgetful functor from the latter to the former. Following Melliès and Zeilberger’s <a href="http://noamz.org/papers/funts.pdf">Functors are Type Refinement Systems</a>, we might attempt to provide a similar characterization for computational type theories with universes, but there are some wrinkles; I attempt to provide a partial resolution to these here.</p>
<div class="read_more">
<a href="./posts/2014-11-22-computational-type-theories-as-refinement-systems.html"> more …</a>
</div>
</article>
<article class="digest">
<h3>
<a href="./posts/2014-10-29-proof-term-assignments-and-intuitionistic-truth.html">Proof Term Assignments and Intuitionistic Truth</a>
<span class="date">October 29, 2014</span>
</h3>
<p>In 1994, Per Martin-Löf wrote <a href="https://github.com/michaelt/martin-lof/blob/master/pdfs/Martin-Lof-Analytic-and-Synthetic-Judgements-in-Type-Theory.pdf">Analytic and Synthetic Judgement in Type Theory</a>, in which he convincingly showed that undecidability phenomena should be understood in terms of synthetic judgement, and demonstrated how the judgements of one theory may be made the propositions of another.</p>
<div class="read_more">
<a href="./posts/2014-10-29-proof-term-assignments-and-intuitionistic-truth.html"> more …</a>
</div>
</article>
<article class="digest">
<h3>
<a href="./posts/2014-10-18-dependent-types-for-pragmatics.html">Dependent Types for Pragmatics</a>
<span class="date">October 18, 2014</span>
</h3>
<p>I am pleased to make available the result of joint research with <a href="http://www.purelytheoretical.com">Darryl McAdams</a>, our new paper <a href="http://arxiv.org/abs/1410.4639">Dependent Types for Pragmatics</a> which is currently under review for publication in the <em>Journal of Logic, Language and Information</em>. I’d like to discuss a few aspects of the work which I consider important, lending additional emphasis to foundational aspects of type theory which I fear were lost in the presentation, which was meant for a general Linguistics audience.</p>
<div class="read_more">
<a href="./posts/2014-10-18-dependent-types-for-pragmatics.html"> more …</a>
</div>
</article>
<article class="digest">
<h3>
<a href="./posts/2014-08-23-realizing-the-truth-in-itt.html">Realizing the Truth in Intensional Type Theory</a>
<span class="date">August 23, 2014</span>
</h3>
<p>The key idea of Observational Type Theory<a href="#fn1" class="footnoteRef" id="fnref1"><sup>1</sup></a> is to make the <em>propositional</em> equality coextensive with the equality which is validated under the standard semantics for Type Theory, which is the meaning explanations and their metamathematical counterpart, the realizability interpretation. Now, Extensional Type Theory is usually characterized in terms of typechecking (membership) being undecidable because the “true” equality is made to hold judgementally; but this is a deceptive characterization when applied to Computational Type Theory (Nuprl), since there are many types besides equality which may be given meaning explanations but which have an undecidable membership judgement.</p>
<div class="read_more">
<a href="./posts/2014-08-23-realizing-the-truth-in-itt.html"> more …</a>
</div>
</article>
<article class="digest">
<h3>
<a href="./posts/2014-08-14-in-defense-of-tactics.html">Synthetic Judgement in Interactive Proof: In Defense of Tactics</a>
<span class="date">August 14, 2014</span>
</h3>
<p>Whilst the judgements of type theory are preferred to be analytic, the practice of operating a proof assistant is inherently and unavoidably synthetic, and is always accompanied by some manner of refinement and tactics: and so the question is never whether to use tactics, but rather how much pain one intends to experience in the process of using them: this is inextricable from the activity of proving.</p>
<div class="read_more">
<a href="./posts/2014-08-14-in-defense-of-tactics.html"> more …</a>
</div>
</article>
<article class="digest">
<h3>
<a href="./posts/2014-08-13-type-theory-podcast-peter-dybjer.html">Interview with Peter Dybjer: types and testing</a>
<span class="date">August 13, 2014</span>
</h3>
<p>I’m so pleased to be able to announce the first fruit of a joint project with David Christiansen and Darin Morrison, which is an interview of Peter Dybjer for <a href="http://typetheorypodcast.com/2014/08/episode-1-peter-dybjer-on-type-theory-and-testing/">The Type Theory Podcast</a>. We spoke to Peter about QuickCheck-style testing and its relation to proofs and verification in type theory. Subscribe to the <a href="http://typetheorypodcast.com/feed/podcast">RSS feed</a> or follow us on <a href="https://twitter.com/typetheorypcast">Twitter</a> if you are interested in listening to discussions with researchers, because we have more to come.</p>
<div class="read_more">
<a href="./posts/2014-08-13-type-theory-podcast-peter-dybjer.html"> more …</a>
</div>
</article>
<article class="digest">
<h3>
<a href="./posts/2014-06-30-a-type-theory-with-scoped-realizability.html">A Type Theory with Scoped Realizability</a>
<span class="date">June 30, 2014</span>
</h3>
<p>Here I present an idea for a type theory which retains the benefits of wholesale adherence to the realizability interpretation<a href="#fn1" class="footnoteRef" id="fnref1"><sup>1</sup></a> à la Nuprl<a href="#fn2" class="footnoteRef" id="fnref2"><sup>2</sup></a>, and yet seems to maintain a better division of labor between operator and machine.</p>
<div class="read_more">
<a href="./posts/2014-06-30-a-type-theory-with-scoped-realizability.html"> more …</a>
</div>
</article>
<article class="digest">
<h3>
<a href="./posts/2014-06-11-non-discrete-records-in-type-theory.html">Non-discrete Records in Type Theory</a>
<span class="date">June 11, 2014</span>
</h3>
<p>In my <a href="http://www.jonmsterling.com/posts/2014-05-11-records-are-sheaves-of-types.html">recent post</a> I demonstrated a type-theoretic formulation of non-dependent record types as presheaves on a particular topological space <span class="math">\(X\)</span> of keys given an assignment <span class="math">\(El_X : X\to\mathbf{Type}\)</span>. Today, I’ll construct more interesting records by endowing the key space with a non-discrete topology.</p>
<div class="read_more">
<a href="./posts/2014-06-11-non-discrete-records-in-type-theory.html"> more …</a>
</div>
</article>
<p>
<a href="./archive.html">All posts…</a>
</p>
</section>
<script src="//static.getclicky.com/js" type="text/javascript"></script>
<script type="text/javascript">try{ clicky.init(66625087);
}catch(e){}</script>
<noscript><p><img alt="Clicky" width="1" height="1" src="//in.getclicky.com/66625087ns.gif" /></p></noscript>
<a rel="me" href="http://twitter.com/jonsterling"></a>
<a rel="me" href="https://alpha.app.net/jonsterling"></a>
</body>
</html>
Jump to Line
Something went wrong with that request. Please try again.