Steffen Zschaler - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged type theory

Towards Using Constructive Type Theory for Verifiable Modular TransformationsSteffen Zschaler, Iman Poernomo, Jeffrey Terrell. In Proc. 1st Workshop on Free Composition (FREECO'11, short paper). 2011.

Normalization by Evaluation for Martin-Löf Type Theory with One UniverseAndreas Abel, Klaus Aehlig, Peter Dybjer. ENTCS, 173:17-39, 2007. [doi]

Internalising modified realisability in constructive type theoryErik Palmgren. lmcs, 1(2), 2005. [doi]

Certifying circuits in Type TheorySolange Coupet-Grimal, Line Jakubiec. fac, 16(4):352-373, 2004. [doi]

Behavioral Compatibility of Self-Typed TheoriesSuad Alagic, Svetlana Kouznetsova. ECOOP 2002: 585-608 [doi]

Equational Theories Generated By Hypersubstitutions of Type (n)Klaus Denecke, Jörg Koppitz, Staszek Niwczyk. ijac, 12(6):867-876, 2002. [doi]

Computational Adequacy for Recursive Types in Models of Intuitionistic Set TheoryAlex K. Simpson. lics 2002: 287-298 [doi]

High-Level Petri Nets as Type Theories in the Join CalculusMaria Grazia Buscemi, Vladimiro Sassone. fossacs 2001: 104-120 [doi]

The Simple Type Theory of Normalization by EvaluationRené Vestergaard. TCS, 57:163-183, 2001. [doi]

Fix-Point Equations for Well-Founded Recursion in Type TheoryAntonia Balaa, Yves Bertot. tphol 2000: 1-16

A General Formulation of Simultaneous Inductive-Recursive Definitions in Type TheoryPeter Dybjer. JSYML, 65(2):525-549, 2000.

Lascar Strong Types in Some Simple TheoriesSteven Buechler. JSYML, 64(2):817-824, 1999.

Logical Predicates for Intuitionistic Linear Type TheoriesMasahito Hasegawa. tlca 1999: 198-212 [doi]

Finding Zeros of Analytic Functions: alpha Theory for Secant Type MethodsJean-Claude Yakoubsohn. jc, 15(2):239-281, 1999. [doi]

Proof of Imperative Programs in Type TheoryJean-Christophe Filliâtre. TYPES 1999: 78-92 [doi]

Reading Between the Lines in Constructive Type TheoryRaymond Turner. logcom, 7(2):229-250, 1997.

A Type-Theoretic Interpretation of Constructive Domain TheoryMichael Hedberg. JAR, 16(3):369-425, 1996.

Weak Theories of Operations and TypesRaymond Turner. logcom, 6(1):5-31, 1996.

Asymmetric Hopfield-type networks: Theory and applicationsZong-Ben Xu, Guo-Qing Hu, Chung-Ping Kwong. NN, 9(3):483-501, 1996. [doi]

A Type Free Theory and Collective/Distributive PredicationFairouz Kamareddine. jolli, 4(2):85-109, 1995.

Hybrid Partial-Total Type TheoryScott F. Smith. ijfcs, 6(3):235-263, 1995.

A Typed Resolution Principle for Deduction with Conditional Typing TheoryTie-Cheng Wang. ai, 75(2):161-194, 1995. [doi]

Expressing Computational Complexity in Constructive Type TheoryRobert L. Constable. lcc 1995: 131-144

A Theory of Qualified TypesMark P. Jones. SCP, 22(3):231-256, 1994.

Discovering Needed Reductions Using Type TheoryPhilippa Gardner. tacs 1994: 555-574

Type Theory and the Informal Language of MathematicsAarne Ranta. TYPES 1994: 352-365

Theory of P-Type Learning Control with Implication for the Robot ManipulatorSamer S. Saab, William G. Vogt, Marlin H. Mickle. icra 1993: 665-671

Strongly-Typed Theory of Structures and BehavioursKeith Hanna, Neil Daeche. charme 1993: 39-54

Universes in the Theory of Types and NamesMarkus Marzetta. csl 1993: 340-351

Type-Free Property Theory, Exemplification and Russell s ParadoxFrancesco Orilia. ndjfl, 32(3):432-447, 1991.

Extracting Recursive Programs in Type TheoryScott F. Smith. amast 1992: 341-349

Toward a General Theory of Computation and Specification over Abstract Data TypesJ. V. Tucker, Jeffery I. Zucker. icci 1990: 129-133

A Partial Functions Version of Church s Simple Theory of TypesWilliam M. Farmer. JSYML, 55(3):1269-1291, 1990.

Domain Interpretations of Martin-Löf s Partial Type TheoryErik Palmgren, Viggo Stoltenberg-Hansen. APAL, 48(2):135-196, 1990.

Omitting Types for Stable CCC TheoriesLudomir Newelski. JSYML, 55(3):1037-1047, 1990.

On the Syntax of Martin-Löf s Type TheoriesA. S. Troelstra. TCS, 51:1-26, 1987.

Recursive Definitions in Type TheoryRobert L. Constable, N. P. Mendler. lop 1985: 61-78

Recent Trends in Data Type Specification, 3rd Workshop on Theory and Applications of Abstract Data Types, Bremen, November 13-16, 1984, Selected PapersHans-Jörg Kreowski, editor, Volume 116 of Informatik-Fachberichte, Springer, 1985.

The Type Theory of PL/CV3Robert L. Constable, Daniel R. Zlatin. TOPLAS, 6(1):94-117, 1984. [doi]

Toward Useful Type-Free Theories. ISolomon Feferman. JSYML, 49(1):75-111, 1984.

Principal Type Schemes for an Extended Type TheorySimona Ronchi Della Rocca, Betti Venneri. TCS, 28:151-169, 1984.

The Type Theory of PL/CV 3Robert L. Constable, Daniel R. Zlatin. lop 1982: 72-93

Axiomatic Data Type Specifications: A First Order Theory of Linear ListsDaniel J. Moore, Bruce Russell. ACTA, 15:193-207, 1981.

A Lattice of Interpretability Types of TheoriesJan Mycielski. JSYML, 42(2):297-305, 1977.

Natural Models and Ackermann-Type Set TheoriesJohn Lake. JSYML, 40(2):151-158, 1975.

On an Ackermann-Type Set TheoryJohn Lake. JSYML, 38(3):410-412, 1973.

Syntactical and Semantical Properties of Simple Type TheoryKurt Schutte. JSYML, 25(4):305-326, 1960.

A Formal Theorem in Church s Theory of TypesM. H. A. Newman, Alan M. Turing. JSYML, 7(1):28-33, 1942.

A Formulation of the Simple Theory of TypesAlonzo Church. JSYML, 5(2):56-68, 1940.

On the Theory of TypesW. V. Quine. JSYML, 3(4):125-139, 1938.

runs on WebDSL