Abstract
We present subsingleton logic as a very small fragment of linear logic containing only \(\oplus \), \(\mathbf {1}\), least fixed points and allowing circular proofs. We show that cut-free proofs in this logic are in a Curry–Howard correspondence with subsequential finite state transducers. Constructions on finite state automata and transducers such as composition, complement, and inverse homomorphism can then be realized uniformly simply by cut and cut elimination. If we freely allow cuts in the proofs, they correspond to a well-typed class of machines we call linear communicating automata, which can also be seen as a generalization of Turing machines with multiple, concurrently operating read/write heads.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Notice that the proposition \(\mathord {\mathbin {\oplus }}_{}\{k{:}A\}\) is distinct from A.
References
Baelde, D.: Least and greatest fixed points in linear logic. ACM Trans. Comput. Logic 13(1) (2012)
Baelde, D., Doumane, A., Saurin, A.: Infinitary proof theory: the multiplicative additive case. In: 25th Conference on Computer Science Logic. LIPIcs, vol. 62, pp. 42:1–42:17 (2016)
Caires, L., Pfenning, F.: Session types as intuitionistic linear propositions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 222–236. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15375-4_16
Church, A., Rosser, J.: Some properties of conversion. Trans. Am. Math. Soc. 39(3), 472–482 (1936)
Curry, H.B.: Functionality in combinatory logic. Proc. Nat. Acad. Sci. U.S.A. 20, 584–590 (1934)
Deniélou, P.-M., Yoshida, N.: Multiparty session types meet communicating automata. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 194–213. Springer, Heidelberg (2012). doi:10.1007/978-3-642-28869-2_10
DeYoung, H., Caires, L., Pfenning, F., Toninho, B.: Cut reduction in linear logic as asynchronous session-typed communication. In: 21st Conference on Computer Science Logic. LIPIcs, vol. 16, pp. 228–242 (2012)
Dummett, M.: The Logical Basis of Metaphysics. Harvard University Press, Cambridge (1991). From the William James Lectures 1976
Fortier, J., Santocanale, L.: Cuts for circular proofs: semantics and cut elimination. In: 22nd Conference on Computer Science Logic. LIPIcs, vol. 23, pp. 248–262 (2013)
Gay, S., Hole, M.: Subtyping for session types in the pi calculus. Acta Informatica 42(2), 191–225 (2005)
Girard, J.Y.: Linear logic. Theoret. Comput. Sci. 50(1), 1–102 (1987)
Howard, W.A.: The formulae-as-types notion of construction (1969), unpublished note. An annotated version appeared in: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 479–490, Academic Press (1980)
Martin-Löf, P.: On the meanings of the logical constants and the justifications of the logical laws. Nord. J. Philos. Logic 1(1), 11–60 (1996)
Mohri, M.: Finite-state transducers in language and speech processing. J. Comput. Linguist. 23(2), 269–311 (1997)
Schützenberger, M.P.: Sur une variante des fonctions sequentielles. Theoret. Comput. Sci. 4(1), 47–57 (1977)
Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42(2), 230–265 (1937)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
DeYoung, H., Pfenning, F. (2016). Substructural Proofs as Automata. In: Igarashi, A. (eds) Programming Languages and Systems. APLAS 2016. Lecture Notes in Computer Science(), vol 10017. Springer, Cham. https://doi.org/10.1007/978-3-319-47958-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-47958-3_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-47957-6
Online ISBN: 978-3-319-47958-3
eBook Packages: Computer ScienceComputer Science (R0)